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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:27:14,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:27:14,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:27:14,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:27:14,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:27:14,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:27:14,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:27:14,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:27:14,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:27:14,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:27:14,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:27:14,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:27:14,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:27:14,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:27:14,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:27:14,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:27:14,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:27:14,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:27:14,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:27:14,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:27:14,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:27:14,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:27:14,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:27:14,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:27:14,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:27:14,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:27:14,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:27:14,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:27:14,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:27:14,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:27:14,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:27:14,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:27:14,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:27:14,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:27:14,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:27:14,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:27:14,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:27:14,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:27:14,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:27:14,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:27:14,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:27:14,867 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:27:14,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:27:14,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:27:14,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:27:14,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:27:14,891 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:27:14,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:27:14,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:27:14,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:27:14,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:27:14,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:27:14,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:27:14,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:27:14,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:27:14,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:27:14,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:27:14,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:27:14,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:27:14,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:27:14,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:27:14,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:27:14,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:27:14,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:27:14,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:27:14,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:27:14,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:27:14,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:27:14,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:27:14,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:27:14,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:27:14,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:27:14,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:27:14,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:27:14,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:27:14,957 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:27:14,960 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+lhb-reducer.c [2019-09-08 12:27:15,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f25cbfc9/a4a4aaefe5334f159f98875ac636cdfd/FLAG07094ea3c [2019-09-08 12:27:15,724 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:27:15,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-08 12:27:15,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f25cbfc9/a4a4aaefe5334f159f98875ac636cdfd/FLAG07094ea3c [2019-09-08 12:27:15,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f25cbfc9/a4a4aaefe5334f159f98875ac636cdfd [2019-09-08 12:27:15,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:27:15,821 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:27:15,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:27:15,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:27:15,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:27:15,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:27:15" (1/1) ... [2019-09-08 12:27:15,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7704c290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:15, skipping insertion in model container [2019-09-08 12:27:15,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:27:15" (1/1) ... [2019-09-08 12:27:15,836 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:27:16,033 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:27:17,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:27:17,488 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:27:18,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:27:18,077 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:27:18,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18 WrapperNode [2019-09-08 12:27:18,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:27:18,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:27:18,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:27:18,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:27:18,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (1/1) ... [2019-09-08 12:27:18,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (1/1) ... [2019-09-08 12:27:18,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (1/1) ... [2019-09-08 12:27:18,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (1/1) ... [2019-09-08 12:27:18,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (1/1) ... [2019-09-08 12:27:18,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (1/1) ... [2019-09-08 12:27:18,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (1/1) ... [2019-09-08 12:27:18,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:27:18,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:27:18,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:27:18,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:27:18,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (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:27:18,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:27:18,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:27:18,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:27:18,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:27:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:27:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:27:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:27:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:27:18,409 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:27:18,409 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:27:18,409 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:27:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:27:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:27:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:27:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:27:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:27:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:27:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:27:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:27:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:27:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:27:21,942 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:27:21,942 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:27:21,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:27:21 BoogieIcfgContainer [2019-09-08 12:27:21,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:27:21,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:27:21,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:27:21,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:27:21,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:27:15" (1/3) ... [2019-09-08 12:27:21,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b981e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:27:21, skipping insertion in model container [2019-09-08 12:27:21,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:27:18" (2/3) ... [2019-09-08 12:27:21,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b981e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:27:21, skipping insertion in model container [2019-09-08 12:27:21,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:27:21" (3/3) ... [2019-09-08 12:27:21,956 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-08 12:27:21,967 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:27:21,990 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-08 12:27:22,008 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-08 12:27:22,059 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:27:22,060 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:27:22,060 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:27:22,060 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:27:22,060 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:27:22,061 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:27:22,061 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:27:22,061 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:27:22,061 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:27:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states. [2019-09-08 12:27:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:27:22,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:22,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:22,145 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:22,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:22,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2055427449, now seen corresponding path program 1 times [2019-09-08 12:27:22,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:22,895 INFO L134 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:27:22,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:22,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:22,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:22,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:22,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:22,920 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand 5 states. [2019-09-08 12:27:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:24,076 INFO L93 Difference]: Finished difference Result 1723 states and 3020 transitions. [2019-09-08 12:27:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:24,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:27:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:24,108 INFO L225 Difference]: With dead ends: 1723 [2019-09-08 12:27:24,108 INFO L226 Difference]: Without dead ends: 879 [2019-09-08 12:27:24,120 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:27:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-09-08 12:27:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-09-08 12:27:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-08 12:27:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1128 transitions. [2019-09-08 12:27:24,257 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1128 transitions. Word has length 90 [2019-09-08 12:27:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:24,257 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1128 transitions. [2019-09-08 12:27:24,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1128 transitions. [2019-09-08 12:27:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:27:24,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:24,264 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:24,265 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1438447416, now seen corresponding path program 1 times [2019-09-08 12:27:24,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:24,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:24,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:24,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:24,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:24,543 INFO L134 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:27:24,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:24,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:24,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:24,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:24,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:24,550 INFO L87 Difference]: Start difference. First operand 879 states and 1128 transitions. Second operand 5 states. [2019-09-08 12:27:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:25,216 INFO L93 Difference]: Finished difference Result 1454 states and 1921 transitions. [2019-09-08 12:27:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:25,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:27:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:25,222 INFO L225 Difference]: With dead ends: 1454 [2019-09-08 12:27:25,222 INFO L226 Difference]: Without dead ends: 754 [2019-09-08 12:27:25,225 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:27:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-08 12:27:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-09-08 12:27:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-09-08 12:27:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 986 transitions. [2019-09-08 12:27:25,258 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 986 transitions. Word has length 91 [2019-09-08 12:27:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:25,258 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 986 transitions. [2019-09-08 12:27:25,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 986 transitions. [2019-09-08 12:27:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:27:25,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:25,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] [2019-09-08 12:27:25,262 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:25,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1744743141, now seen corresponding path program 1 times [2019-09-08 12:27:25,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:25,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:25,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:25,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:25,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:25,554 INFO L134 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:27:25,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:25,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:25,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:25,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:25,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:25,558 INFO L87 Difference]: Start difference. First operand 754 states and 986 transitions. Second operand 5 states. [2019-09-08 12:27:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:26,191 INFO L93 Difference]: Finished difference Result 1329 states and 1778 transitions. [2019-09-08 12:27:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:26,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 12:27:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:26,198 INFO L225 Difference]: With dead ends: 1329 [2019-09-08 12:27:26,198 INFO L226 Difference]: Without dead ends: 696 [2019-09-08 12:27:26,200 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:27:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-08 12:27:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2019-09-08 12:27:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-08 12:27:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 919 transitions. [2019-09-08 12:27:26,234 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 919 transitions. Word has length 92 [2019-09-08 12:27:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:26,235 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 919 transitions. [2019-09-08 12:27:26,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 919 transitions. [2019-09-08 12:27:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:27:26,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:26,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:26,241 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:26,241 INFO L82 PathProgramCache]: Analyzing trace with hash 986983178, now seen corresponding path program 1 times [2019-09-08 12:27:26,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:26,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:26,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:26,387 INFO L134 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:27:26,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:26,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:26,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:26,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:26,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:26,388 INFO L87 Difference]: Start difference. First operand 696 states and 919 transitions. Second operand 5 states. [2019-09-08 12:27:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:27,090 INFO L93 Difference]: Finished difference Result 1271 states and 1710 transitions. [2019-09-08 12:27:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:27,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:27:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:27,097 INFO L225 Difference]: With dead ends: 1271 [2019-09-08 12:27:27,098 INFO L226 Difference]: Without dead ends: 670 [2019-09-08 12:27:27,099 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:27:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-08 12:27:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-09-08 12:27:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-08 12:27:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 888 transitions. [2019-09-08 12:27:27,127 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 888 transitions. Word has length 93 [2019-09-08 12:27:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:27,128 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 888 transitions. [2019-09-08 12:27:27,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 888 transitions. [2019-09-08 12:27:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:27:27,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:27,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:27,131 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash 925768771, now seen corresponding path program 1 times [2019-09-08 12:27:27,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:27,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:27,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:27,331 INFO L134 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:27:27,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:27,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:27,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:27,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:27,334 INFO L87 Difference]: Start difference. First operand 670 states and 888 transitions. Second operand 5 states. [2019-09-08 12:27:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:27,976 INFO L93 Difference]: Finished difference Result 1245 states and 1678 transitions. [2019-09-08 12:27:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:27,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-08 12:27:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:27,981 INFO L225 Difference]: With dead ends: 1245 [2019-09-08 12:27:27,982 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 12:27:27,984 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:27:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 12:27:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 12:27:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 12:27:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 866 transitions. [2019-09-08 12:27:28,028 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 866 transitions. Word has length 94 [2019-09-08 12:27:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:28,029 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 866 transitions. [2019-09-08 12:27:28,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 866 transitions. [2019-09-08 12:27:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:27:28,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:28,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:28,033 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2129638404, now seen corresponding path program 1 times [2019-09-08 12:27:28,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:28,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:28,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:28,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:28,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:27:28,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:27:28,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:27:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:27:28,184 INFO L87 Difference]: Start difference. First operand 651 states and 866 transitions. Second operand 5 states. [2019-09-08 12:27:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:29,031 INFO L93 Difference]: Finished difference Result 1226 states and 1655 transitions. [2019-09-08 12:27:29,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:27:29,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 12:27:29,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:29,036 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 12:27:29,037 INFO L226 Difference]: Without dead ends: 646 [2019-09-08 12:27:29,038 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:27:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-08 12:27:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-09-08 12:27:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 859 transitions. [2019-09-08 12:27:29,069 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 859 transitions. Word has length 95 [2019-09-08 12:27:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:29,071 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 859 transitions. [2019-09-08 12:27:29,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:27:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 859 transitions. [2019-09-08 12:27:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:27:29,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:29,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] [2019-09-08 12:27:29,074 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:29,080 INFO L82 PathProgramCache]: Analyzing trace with hash -631577471, now seen corresponding path program 1 times [2019-09-08 12:27:29,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:29,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:29,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:29,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:29,391 INFO L134 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:27:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:27:29,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:27:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:27:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:27:29,393 INFO L87 Difference]: Start difference. First operand 646 states and 859 transitions. Second operand 8 states. [2019-09-08 12:27:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:30,599 INFO L93 Difference]: Finished difference Result 1216 states and 1574 transitions. [2019-09-08 12:27:30,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:27:30,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-09-08 12:27:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:30,604 INFO L225 Difference]: With dead ends: 1216 [2019-09-08 12:27:30,604 INFO L226 Difference]: Without dead ends: 869 [2019-09-08 12:27:30,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:27:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-09-08 12:27:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 646. [2019-09-08 12:27:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 858 transitions. [2019-09-08 12:27:30,650 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 858 transitions. Word has length 96 [2019-09-08 12:27:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:30,650 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 858 transitions. [2019-09-08 12:27:30,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:27:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 858 transitions. [2019-09-08 12:27:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:27:30,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:30,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:30,654 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash -938716295, now seen corresponding path program 1 times [2019-09-08 12:27:30,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:30,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:31,054 INFO L134 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:27:31,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:31,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:31,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:31,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:31,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:31,057 INFO L87 Difference]: Start difference. First operand 646 states and 858 transitions. Second operand 9 states. [2019-09-08 12:27:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:33,522 INFO L93 Difference]: Finished difference Result 1342 states and 1822 transitions. [2019-09-08 12:27:33,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:33,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:27:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:33,528 INFO L225 Difference]: With dead ends: 1342 [2019-09-08 12:27:33,528 INFO L226 Difference]: Without dead ends: 1148 [2019-09-08 12:27:33,530 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:27:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-08 12:27:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 646. [2019-09-08 12:27:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 857 transitions. [2019-09-08 12:27:33,632 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 857 transitions. Word has length 96 [2019-09-08 12:27:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:33,632 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 857 transitions. [2019-09-08 12:27:33,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 857 transitions. [2019-09-08 12:27:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:27:33,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:33,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:33,636 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash 727798889, now seen corresponding path program 1 times [2019-09-08 12:27:33,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:33,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:33,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:33,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:27:33,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:33,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:33,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:33,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:33,902 INFO L87 Difference]: Start difference. First operand 646 states and 857 transitions. Second operand 9 states. [2019-09-08 12:27:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:36,209 INFO L93 Difference]: Finished difference Result 1269 states and 1725 transitions. [2019-09-08 12:27:36,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:36,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:27:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:36,217 INFO L225 Difference]: With dead ends: 1269 [2019-09-08 12:27:36,218 INFO L226 Difference]: Without dead ends: 1144 [2019-09-08 12:27:36,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:27:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-08 12:27:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 646. [2019-09-08 12:27:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 856 transitions. [2019-09-08 12:27:36,300 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 856 transitions. Word has length 96 [2019-09-08 12:27:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:36,300 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 856 transitions. [2019-09-08 12:27:36,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 856 transitions. [2019-09-08 12:27:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:36,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:36,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:36,304 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:36,304 INFO L82 PathProgramCache]: Analyzing trace with hash 215751310, now seen corresponding path program 1 times [2019-09-08 12:27:36,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:36,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:36,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:36,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:36,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:36,504 INFO L134 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:27:36,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:36,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:36,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:36,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:36,506 INFO L87 Difference]: Start difference. First operand 646 states and 856 transitions. Second operand 9 states. [2019-09-08 12:27:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:38,843 INFO L93 Difference]: Finished difference Result 1283 states and 1735 transitions. [2019-09-08 12:27:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:38,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:38,850 INFO L225 Difference]: With dead ends: 1283 [2019-09-08 12:27:38,851 INFO L226 Difference]: Without dead ends: 1144 [2019-09-08 12:27:38,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:27:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-08 12:27:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 646. [2019-09-08 12:27:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 855 transitions. [2019-09-08 12:27:38,898 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 855 transitions. Word has length 98 [2019-09-08 12:27:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:38,899 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 855 transitions. [2019-09-08 12:27:38,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 855 transitions. [2019-09-08 12:27:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:38,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:38,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:38,903 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:38,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1180953076, now seen corresponding path program 1 times [2019-09-08 12:27:38,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:38,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:38,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:38,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:38,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:39,129 INFO L134 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:27:39,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:39,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:39,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:39,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:39,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:39,131 INFO L87 Difference]: Start difference. First operand 646 states and 855 transitions. Second operand 9 states. [2019-09-08 12:27:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:41,008 INFO L93 Difference]: Finished difference Result 1207 states and 1621 transitions. [2019-09-08 12:27:41,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:41,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:41,015 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 12:27:41,015 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:27:41,016 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:27:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:27:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:27:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 854 transitions. [2019-09-08 12:27:41,063 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 854 transitions. Word has length 98 [2019-09-08 12:27:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:41,063 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 854 transitions. [2019-09-08 12:27:41,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 854 transitions. [2019-09-08 12:27:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:41,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:41,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] [2019-09-08 12:27:41,067 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1576132324, now seen corresponding path program 1 times [2019-09-08 12:27:41,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:41,261 INFO L134 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:27:41,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:41,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:41,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:41,262 INFO L87 Difference]: Start difference. First operand 646 states and 854 transitions. Second operand 9 states. [2019-09-08 12:27:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:43,774 INFO L93 Difference]: Finished difference Result 1371 states and 1842 transitions. [2019-09-08 12:27:43,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:43,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:43,780 INFO L225 Difference]: With dead ends: 1371 [2019-09-08 12:27:43,780 INFO L226 Difference]: Without dead ends: 1148 [2019-09-08 12:27:43,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:27:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-08 12:27:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 646. [2019-09-08 12:27:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 853 transitions. [2019-09-08 12:27:43,827 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 853 transitions. Word has length 98 [2019-09-08 12:27:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:43,828 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 853 transitions. [2019-09-08 12:27:43,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 853 transitions. [2019-09-08 12:27:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:43,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:43,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:43,831 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1300093119, now seen corresponding path program 1 times [2019-09-08 12:27:43,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:43,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:43,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:43,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:43,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:44,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:27:44,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:44,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:44,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:44,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:44,017 INFO L87 Difference]: Start difference. First operand 646 states and 853 transitions. Second operand 9 states. [2019-09-08 12:27:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:46,419 INFO L93 Difference]: Finished difference Result 1236 states and 1667 transitions. [2019-09-08 12:27:46,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:46,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:46,426 INFO L225 Difference]: With dead ends: 1236 [2019-09-08 12:27:46,426 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:27:46,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:27:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:27:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-08 12:27:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 852 transitions. [2019-09-08 12:27:46,475 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 852 transitions. Word has length 98 [2019-09-08 12:27:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:46,476 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 852 transitions. [2019-09-08 12:27:46,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 852 transitions. [2019-09-08 12:27:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:46,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:46,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:46,479 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1810473432, now seen corresponding path program 1 times [2019-09-08 12:27:46,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:46,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:46,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:46,688 INFO L134 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:27:46,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:46,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:46,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:46,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:46,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:46,692 INFO L87 Difference]: Start difference. First operand 646 states and 852 transitions. Second operand 9 states. [2019-09-08 12:27:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:48,641 INFO L93 Difference]: Finished difference Result 1207 states and 1618 transitions. [2019-09-08 12:27:48,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:48,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:48,648 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 12:27:48,648 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:27:48,649 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:27:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:27:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:27:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 851 transitions. [2019-09-08 12:27:48,702 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 851 transitions. Word has length 98 [2019-09-08 12:27:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:48,703 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 851 transitions. [2019-09-08 12:27:48,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 851 transitions. [2019-09-08 12:27:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:48,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:48,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:48,706 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1939924177, now seen corresponding path program 1 times [2019-09-08 12:27:48,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:48,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:48,889 INFO L134 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:27:48,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:48,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:48,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:48,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:48,890 INFO L87 Difference]: Start difference. First operand 646 states and 851 transitions. Second operand 9 states. [2019-09-08 12:27:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:50,651 INFO L93 Difference]: Finished difference Result 1212 states and 1621 transitions. [2019-09-08 12:27:50,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:50,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:50,657 INFO L225 Difference]: With dead ends: 1212 [2019-09-08 12:27:50,657 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:27:50,658 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:27:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:27:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:27:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 850 transitions. [2019-09-08 12:27:50,711 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 850 transitions. Word has length 98 [2019-09-08 12:27:50,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:50,712 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 850 transitions. [2019-09-08 12:27:50,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 850 transitions. [2019-09-08 12:27:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:50,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:50,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:50,715 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash 425886607, now seen corresponding path program 1 times [2019-09-08 12:27:50,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:50,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:50,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:50,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:50,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:50,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:50,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:50,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:50,916 INFO L87 Difference]: Start difference. First operand 646 states and 850 transitions. Second operand 9 states. [2019-09-08 12:27:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:53,420 INFO L93 Difference]: Finished difference Result 1283 states and 1727 transitions. [2019-09-08 12:27:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:53,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:53,426 INFO L225 Difference]: With dead ends: 1283 [2019-09-08 12:27:53,426 INFO L226 Difference]: Without dead ends: 1144 [2019-09-08 12:27:53,427 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:27:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-08 12:27:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 646. [2019-09-08 12:27:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 849 transitions. [2019-09-08 12:27:53,484 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 849 transitions. Word has length 98 [2019-09-08 12:27:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:53,484 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 849 transitions. [2019-09-08 12:27:53,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 849 transitions. [2019-09-08 12:27:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:53,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:53,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:53,487 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:53,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -341357961, now seen corresponding path program 1 times [2019-09-08 12:27:53,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:53,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:53,682 INFO L134 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:27:53,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:53,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:53,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:53,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:53,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:53,684 INFO L87 Difference]: Start difference. First operand 646 states and 849 transitions. Second operand 9 states. [2019-09-08 12:27:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:55,556 INFO L93 Difference]: Finished difference Result 1203 states and 1610 transitions. [2019-09-08 12:27:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:55,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:55,562 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 12:27:55,563 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:27:55,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:27:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:27:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:27:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 848 transitions. [2019-09-08 12:27:55,619 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 848 transitions. Word has length 98 [2019-09-08 12:27:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:55,619 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 848 transitions. [2019-09-08 12:27:55,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 848 transitions. [2019-09-08 12:27:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:27:55,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:55,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:55,622 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash -976253424, now seen corresponding path program 1 times [2019-09-08 12:27:55,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:55,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:55,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:55,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:55,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:55,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:55,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:55,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:55,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:55,803 INFO L87 Difference]: Start difference. First operand 646 states and 848 transitions. Second operand 9 states. [2019-09-08 12:27:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:57,684 INFO L93 Difference]: Finished difference Result 1207 states and 1611 transitions. [2019-09-08 12:27:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:57,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:27:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:57,690 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 12:27:57,691 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:27:57,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:27:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:27:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:27:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:27:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 847 transitions. [2019-09-08 12:27:57,746 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 847 transitions. Word has length 98 [2019-09-08 12:27:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:57,746 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 847 transitions. [2019-09-08 12:27:57,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 847 transitions. [2019-09-08 12:27:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:27:57,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:57,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] [2019-09-08 12:27:57,749 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash 130488343, now seen corresponding path program 1 times [2019-09-08 12:27:57,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:57,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:57,937 INFO L134 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:27:57,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:57,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:57,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:57,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:57,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:57,940 INFO L87 Difference]: Start difference. First operand 646 states and 847 transitions. Second operand 9 states. [2019-09-08 12:27:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:59,982 INFO L93 Difference]: Finished difference Result 1207 states and 1610 transitions. [2019-09-08 12:27:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:59,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:27:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:59,986 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 12:27:59,987 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:27:59,987 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:27:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 846 transitions. [2019-09-08 12:28:00,053 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 846 transitions. Word has length 100 [2019-09-08 12:28:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:00,054 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 846 transitions. [2019-09-08 12:28:00,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 846 transitions. [2019-09-08 12:28:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:00,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:00,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,057 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1037598, now seen corresponding path program 1 times [2019-09-08 12:28:00,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:00,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:00,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:00,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:00,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:28:00,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:00,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:00,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:00,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:00,283 INFO L87 Difference]: Start difference. First operand 646 states and 846 transitions. Second operand 9 states. [2019-09-08 12:28:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:02,712 INFO L93 Difference]: Finished difference Result 1245 states and 1665 transitions. [2019-09-08 12:28:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:02,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:02,717 INFO L225 Difference]: With dead ends: 1245 [2019-09-08 12:28:02,717 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:28:02,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:28:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:28:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-08 12:28:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 845 transitions. [2019-09-08 12:28:02,772 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 845 transitions. Word has length 100 [2019-09-08 12:28:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:02,772 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 845 transitions. [2019-09-08 12:28:02,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 845 transitions. [2019-09-08 12:28:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:02,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:02,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,775 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:02,775 INFO L82 PathProgramCache]: Analyzing trace with hash -597494101, now seen corresponding path program 1 times [2019-09-08 12:28:02,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:02,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:02,939 INFO L134 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:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:02,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:02,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:02,941 INFO L87 Difference]: Start difference. First operand 646 states and 845 transitions. Second operand 9 states. [2019-09-08 12:28:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:05,493 INFO L93 Difference]: Finished difference Result 1298 states and 1734 transitions. [2019-09-08 12:28:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:05,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:05,498 INFO L225 Difference]: With dead ends: 1298 [2019-09-08 12:28:05,498 INFO L226 Difference]: Without dead ends: 1144 [2019-09-08 12:28:05,499 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:28:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-08 12:28:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 646. [2019-09-08 12:28:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 844 transitions. [2019-09-08 12:28:05,542 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 844 transitions. Word has length 100 [2019-09-08 12:28:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:05,543 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 844 transitions. [2019-09-08 12:28:05,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 844 transitions. [2019-09-08 12:28:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:05,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:05,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:05,545 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:05,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1136805223, now seen corresponding path program 1 times [2019-09-08 12:28:05,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:05,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:05,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:05,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:05,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:05,717 INFO L134 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:05,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:05,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:05,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:05,718 INFO L87 Difference]: Start difference. First operand 646 states and 844 transitions. Second operand 9 states. [2019-09-08 12:28:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:08,112 INFO L93 Difference]: Finished difference Result 1236 states and 1653 transitions. [2019-09-08 12:28:08,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:08,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:08,118 INFO L225 Difference]: With dead ends: 1236 [2019-09-08 12:28:08,118 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:28:08,119 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:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:28:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-08 12:28:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 843 transitions. [2019-09-08 12:28:08,167 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 843 transitions. Word has length 100 [2019-09-08 12:28:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:08,167 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 843 transitions. [2019-09-08 12:28:08,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 843 transitions. [2019-09-08 12:28:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:08,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:08,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,169 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:08,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1634882529, now seen corresponding path program 1 times [2019-09-08 12:28:08,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:08,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:08,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:08,373 INFO L134 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:08,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:08,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:08,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:08,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:08,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:08,375 INFO L87 Difference]: Start difference. First operand 646 states and 843 transitions. Second operand 9 states. [2019-09-08 12:28:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:10,288 INFO L93 Difference]: Finished difference Result 1203 states and 1602 transitions. [2019-09-08 12:28:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:10,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:10,293 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 12:28:10,293 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:28:10,294 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:28:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 842 transitions. [2019-09-08 12:28:10,356 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 842 transitions. Word has length 100 [2019-09-08 12:28:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:10,357 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 842 transitions. [2019-09-08 12:28:10,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 842 transitions. [2019-09-08 12:28:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:10,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:10,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,359 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash -685545711, now seen corresponding path program 1 times [2019-09-08 12:28:10,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:10,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:10,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:10,555 INFO L134 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:10,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:10,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:10,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:10,565 INFO L87 Difference]: Start difference. First operand 646 states and 842 transitions. Second operand 9 states. [2019-09-08 12:28:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:12,432 INFO L93 Difference]: Finished difference Result 1207 states and 1604 transitions. [2019-09-08 12:28:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:12,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:12,437 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 12:28:12,437 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:28:12,438 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:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 841 transitions. [2019-09-08 12:28:12,481 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 841 transitions. Word has length 100 [2019-09-08 12:28:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:12,481 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 841 transitions. [2019-09-08 12:28:12,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 841 transitions. [2019-09-08 12:28:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:12,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:12,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,483 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2035564676, now seen corresponding path program 1 times [2019-09-08 12:28:12,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:12,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:12,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:12,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:28:12,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:12,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:12,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:12,685 INFO L87 Difference]: Start difference. First operand 646 states and 841 transitions. Second operand 9 states. [2019-09-08 12:28:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:15,328 INFO L93 Difference]: Finished difference Result 1245 states and 1657 transitions. [2019-09-08 12:28:15,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:15,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:15,334 INFO L225 Difference]: With dead ends: 1245 [2019-09-08 12:28:15,334 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:28:15,335 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:28:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:28:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-08 12:28:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 840 transitions. [2019-09-08 12:28:15,381 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 840 transitions. Word has length 100 [2019-09-08 12:28:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:15,382 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 840 transitions. [2019-09-08 12:28:15,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 840 transitions. [2019-09-08 12:28:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:15,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:15,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] [2019-09-08 12:28:15,384 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash 232149422, now seen corresponding path program 1 times [2019-09-08 12:28:15,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:15,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:15,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:15,548 INFO L134 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:15,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:15,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:15,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:15,550 INFO L87 Difference]: Start difference. First operand 646 states and 840 transitions. Second operand 9 states. [2019-09-08 12:28:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:18,129 INFO L93 Difference]: Finished difference Result 1245 states and 1656 transitions. [2019-09-08 12:28:18,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:18,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:18,134 INFO L225 Difference]: With dead ends: 1245 [2019-09-08 12:28:18,134 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:28:18,135 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:28:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:28:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-08 12:28:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 839 transitions. [2019-09-08 12:28:18,181 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 839 transitions. Word has length 100 [2019-09-08 12:28:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:18,182 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 839 transitions. [2019-09-08 12:28:18,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 839 transitions. [2019-09-08 12:28:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:18,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:18,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,184 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1574304686, now seen corresponding path program 1 times [2019-09-08 12:28:18,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:18,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:18,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:18,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:18,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:18,342 INFO L134 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:18,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:18,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:18,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:18,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:18,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:18,343 INFO L87 Difference]: Start difference. First operand 646 states and 839 transitions. Second operand 9 states. [2019-09-08 12:28:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:20,602 INFO L93 Difference]: Finished difference Result 1203 states and 1598 transitions. [2019-09-08 12:28:20,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:20,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:20,608 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 12:28:20,608 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:28:20,609 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:28:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 838 transitions. [2019-09-08 12:28:20,663 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 838 transitions. Word has length 100 [2019-09-08 12:28:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:20,663 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 838 transitions. [2019-09-08 12:28:20,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 838 transitions. [2019-09-08 12:28:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:20,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:20,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] [2019-09-08 12:28:20,665 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:20,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:20,666 INFO L82 PathProgramCache]: Analyzing trace with hash 622153299, now seen corresponding path program 1 times [2019-09-08 12:28:20,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:20,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:20,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:20,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:20,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:20,839 INFO L134 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,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:20,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:20,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:20,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:20,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:20,840 INFO L87 Difference]: Start difference. First operand 646 states and 838 transitions. Second operand 9 states. [2019-09-08 12:28:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:23,236 INFO L93 Difference]: Finished difference Result 1207 states and 1601 transitions. [2019-09-08 12:28:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:23,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:23,241 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 12:28:23,241 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:28:23,242 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:28:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 837 transitions. [2019-09-08 12:28:23,289 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 837 transitions. Word has length 100 [2019-09-08 12:28:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:23,290 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 837 transitions. [2019-09-08 12:28:23,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 837 transitions. [2019-09-08 12:28:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:23,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:23,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,291 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:23,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1503778103, now seen corresponding path program 1 times [2019-09-08 12:28:23,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:23,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:23,443 INFO L134 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,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:23,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:23,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:23,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:23,445 INFO L87 Difference]: Start difference. First operand 646 states and 837 transitions. Second operand 9 states. [2019-09-08 12:28:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:25,698 INFO L93 Difference]: Finished difference Result 1231 states and 1639 transitions. [2019-09-08 12:28:25,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:25,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:25,703 INFO L225 Difference]: With dead ends: 1231 [2019-09-08 12:28:25,703 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:28:25,704 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:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:28:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-08 12:28:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 836 transitions. [2019-09-08 12:28:25,752 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 836 transitions. Word has length 100 [2019-09-08 12:28:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:25,752 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 836 transitions. [2019-09-08 12:28:25,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 836 transitions. [2019-09-08 12:28:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:25,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:25,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,754 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1753298871, now seen corresponding path program 1 times [2019-09-08 12:28:25,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:25,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:25,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:25,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:25,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:25,915 INFO L134 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,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:25,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:25,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:25,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:25,916 INFO L87 Difference]: Start difference. First operand 646 states and 836 transitions. Second operand 9 states. [2019-09-08 12:28:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:28,216 INFO L93 Difference]: Finished difference Result 1202 states and 1593 transitions. [2019-09-08 12:28:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:28,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:28,220 INFO L225 Difference]: With dead ends: 1202 [2019-09-08 12:28:28,220 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:28:28,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:28:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 835 transitions. [2019-09-08 12:28:28,271 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 835 transitions. Word has length 100 [2019-09-08 12:28:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:28,271 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 835 transitions. [2019-09-08 12:28:28,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 835 transitions. [2019-09-08 12:28:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:28,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:28,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:28,273 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash -716089058, now seen corresponding path program 1 times [2019-09-08 12:28:28,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:28,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:28,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:28,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:28:28,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:28,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:28,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:28,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:28,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:28,436 INFO L87 Difference]: Start difference. First operand 646 states and 835 transitions. Second operand 9 states. [2019-09-08 12:28:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:30,562 INFO L93 Difference]: Finished difference Result 1236 states and 1641 transitions. [2019-09-08 12:28:30,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:30,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:30,566 INFO L225 Difference]: With dead ends: 1236 [2019-09-08 12:28:30,566 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:28:30,567 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:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:28:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-08 12:28:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 834 transitions. [2019-09-08 12:28:30,618 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 834 transitions. Word has length 100 [2019-09-08 12:28:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:30,619 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 834 transitions. [2019-09-08 12:28:30,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 834 transitions. [2019-09-08 12:28:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:30,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:30,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,620 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1807326229, now seen corresponding path program 1 times [2019-09-08 12:28:30,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:30,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:30,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:30,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:30,772 INFO L134 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,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:30,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:30,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:30,774 INFO L87 Difference]: Start difference. First operand 646 states and 834 transitions. Second operand 9 states. [2019-09-08 12:28:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:32,830 INFO L93 Difference]: Finished difference Result 1203 states and 1592 transitions. [2019-09-08 12:28:32,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:32,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:32,834 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 12:28:32,834 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:28:32,835 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:28:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 833 transitions. [2019-09-08 12:28:32,897 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 833 transitions. Word has length 100 [2019-09-08 12:28:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:32,897 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 833 transitions. [2019-09-08 12:28:32,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 833 transitions. [2019-09-08 12:28:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:32,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:32,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, 1, 1, 1] [2019-09-08 12:28:32,899 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash -347748653, now seen corresponding path program 1 times [2019-09-08 12:28:32,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:32,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:32,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:32,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:33,038 INFO L134 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:33,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:33,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:33,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:33,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:33,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:33,039 INFO L87 Difference]: Start difference. First operand 646 states and 833 transitions. Second operand 9 states. [2019-09-08 12:28:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:35,469 INFO L93 Difference]: Finished difference Result 1251 states and 1652 transitions. [2019-09-08 12:28:35,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:35,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:35,472 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:28:35,472 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:28:35,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:28:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:28:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-08 12:28:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 832 transitions. [2019-09-08 12:28:35,562 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 832 transitions. Word has length 102 [2019-09-08 12:28:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:35,563 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 832 transitions. [2019-09-08 12:28:35,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 832 transitions. [2019-09-08 12:28:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:35,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:35,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,565 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1867430125, now seen corresponding path program 1 times [2019-09-08 12:28:35,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:35,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:35,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:35,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:35,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:35,720 INFO L134 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:35,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:35,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:35,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:35,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:35,722 INFO L87 Difference]: Start difference. First operand 646 states and 832 transitions. Second operand 9 states. [2019-09-08 12:28:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:38,027 INFO L93 Difference]: Finished difference Result 1168 states and 1533 transitions. [2019-09-08 12:28:38,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:38,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:38,031 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 12:28:38,031 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:28:38,032 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:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:28:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:28:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 831 transitions. [2019-09-08 12:28:38,127 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 831 transitions. Word has length 102 [2019-09-08 12:28:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:38,127 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 831 transitions. [2019-09-08 12:28:38,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 831 transitions. [2019-09-08 12:28:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:38,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:38,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,131 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash -498380659, now seen corresponding path program 1 times [2019-09-08 12:28:38,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:38,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:38,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:38,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:38,374 INFO L134 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:38,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:38,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:38,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:38,377 INFO L87 Difference]: Start difference. First operand 646 states and 831 transitions. Second operand 9 states. [2019-09-08 12:28:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:40,559 INFO L93 Difference]: Finished difference Result 1212 states and 1597 transitions. [2019-09-08 12:28:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:40,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:40,562 INFO L225 Difference]: With dead ends: 1212 [2019-09-08 12:28:40,562 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:28:40,563 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:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 830 transitions. [2019-09-08 12:28:40,656 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 830 transitions. Word has length 102 [2019-09-08 12:28:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:40,656 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 830 transitions. [2019-09-08 12:28:40,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 830 transitions. [2019-09-08 12:28:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:40,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:40,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,659 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1161693327, now seen corresponding path program 1 times [2019-09-08 12:28:40,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:40,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:40,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:40,819 INFO L134 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,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:40,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:40,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:40,821 INFO L87 Difference]: Start difference. First operand 646 states and 830 transitions. Second operand 9 states. [2019-09-08 12:28:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:43,214 INFO L93 Difference]: Finished difference Result 1212 states and 1596 transitions. [2019-09-08 12:28:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:43,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:43,217 INFO L225 Difference]: With dead ends: 1212 [2019-09-08 12:28:43,217 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:28:43,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:28:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:28:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:28:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 829 transitions. [2019-09-08 12:28:43,305 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 829 transitions. Word has length 102 [2019-09-08 12:28:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:43,306 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 829 transitions. [2019-09-08 12:28:43,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 829 transitions. [2019-09-08 12:28:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:43,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:43,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,308 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1204117457, now seen corresponding path program 1 times [2019-09-08 12:28:43,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:43,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:43,461 INFO L134 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:43,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:43,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:43,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:43,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:43,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:43,462 INFO L87 Difference]: Start difference. First operand 646 states and 829 transitions. Second operand 9 states. [2019-09-08 12:28:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:45,869 INFO L93 Difference]: Finished difference Result 1168 states and 1530 transitions. [2019-09-08 12:28:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:45,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:45,872 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 12:28:45,873 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:28:45,874 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:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:28:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:28:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 828 transitions. [2019-09-08 12:28:45,965 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 828 transitions. Word has length 102 [2019-09-08 12:28:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:45,965 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 828 transitions. [2019-09-08 12:28:45,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 828 transitions. [2019-09-08 12:28:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:45,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:45,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,967 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash 42902853, now seen corresponding path program 1 times [2019-09-08 12:28:45,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:45,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:45,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:46,127 INFO L134 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:46,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:46,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:46,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:46,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:46,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:46,128 INFO L87 Difference]: Start difference. First operand 646 states and 828 transitions. Second operand 9 states. [2019-09-08 12:28:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:48,558 INFO L93 Difference]: Finished difference Result 1168 states and 1529 transitions. [2019-09-08 12:28:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:48,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:48,560 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 12:28:48,560 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:28:48,561 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:28:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:28:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:28:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 827 transitions. [2019-09-08 12:28:48,618 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 827 transitions. Word has length 102 [2019-09-08 12:28:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:48,619 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 827 transitions. [2019-09-08 12:28:48,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 827 transitions. [2019-09-08 12:28:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:48,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:48,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,620 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2126723695, now seen corresponding path program 1 times [2019-09-08 12:28:48,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:48,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:48,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:48,767 INFO L134 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:48,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:48,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:48,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:48,769 INFO L87 Difference]: Start difference. First operand 646 states and 827 transitions. Second operand 9 states. [2019-09-08 12:28:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:50,890 INFO L93 Difference]: Finished difference Result 1165 states and 1524 transitions. [2019-09-08 12:28:50,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:50,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:50,892 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:28:50,892 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:28:50,893 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:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:28:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:28:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 826 transitions. [2019-09-08 12:28:50,953 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 826 transitions. Word has length 102 [2019-09-08 12:28:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:50,953 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 826 transitions. [2019-09-08 12:28:50,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 826 transitions. [2019-09-08 12:28:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:50,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:50,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,954 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:50,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1042767201, now seen corresponding path program 1 times [2019-09-08 12:28:50,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:50,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:50,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:50,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:50,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:51,096 INFO L134 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:51,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:51,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:51,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:51,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:51,097 INFO L87 Difference]: Start difference. First operand 646 states and 826 transitions. Second operand 9 states. [2019-09-08 12:28:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:53,334 INFO L93 Difference]: Finished difference Result 1165 states and 1523 transitions. [2019-09-08 12:28:53,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:53,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:53,337 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:28:53,337 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:28:53,338 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:28:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:28:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:28:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 825 transitions. [2019-09-08 12:28:53,431 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 825 transitions. Word has length 102 [2019-09-08 12:28:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:53,431 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 825 transitions. [2019-09-08 12:28:53,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 825 transitions. [2019-09-08 12:28:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:53,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:53,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,433 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:53,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:53,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1199777118, now seen corresponding path program 1 times [2019-09-08 12:28:53,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:53,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:53,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:53,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:53,578 INFO L134 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:53,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:53,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:53,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:53,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:53,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:53,579 INFO L87 Difference]: Start difference. First operand 646 states and 825 transitions. Second operand 9 states. [2019-09-08 12:28:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:55,869 INFO L93 Difference]: Finished difference Result 1163 states and 1519 transitions. [2019-09-08 12:28:55,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:55,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:55,871 INFO L225 Difference]: With dead ends: 1163 [2019-09-08 12:28:55,871 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:28:55,872 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:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:28:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:28:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 824 transitions. [2019-09-08 12:28:55,954 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 824 transitions. Word has length 102 [2019-09-08 12:28:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:55,954 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 824 transitions. [2019-09-08 12:28:55,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 824 transitions. [2019-09-08 12:28:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:55,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:55,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] [2019-09-08 12:28:55,955 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash -239523668, now seen corresponding path program 1 times [2019-09-08 12:28:55,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:56,097 INFO L134 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:56,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:56,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:56,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:56,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:56,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:56,098 INFO L87 Difference]: Start difference. First operand 646 states and 824 transitions. Second operand 9 states. [2019-09-08 12:28:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:58,486 INFO L93 Difference]: Finished difference Result 1093 states and 1412 transitions. [2019-09-08 12:28:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:58,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:58,488 INFO L225 Difference]: With dead ends: 1093 [2019-09-08 12:28:58,488 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:28:58,488 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:28:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:28:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:28:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:28:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 823 transitions. [2019-09-08 12:28:58,550 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 823 transitions. Word has length 102 [2019-09-08 12:28:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:58,550 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 823 transitions. [2019-09-08 12:28:58,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 823 transitions. [2019-09-08 12:28:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:58,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:58,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,552 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1033951035, now seen corresponding path program 1 times [2019-09-08 12:28:58,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:58,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:58,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:58,700 INFO L134 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:58,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:58,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:58,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:58,702 INFO L87 Difference]: Start difference. First operand 646 states and 823 transitions. Second operand 9 states. [2019-09-08 12:29:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:00,742 INFO L93 Difference]: Finished difference Result 1165 states and 1518 transitions. [2019-09-08 12:29:00,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:00,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:00,744 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:29:00,744 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:00,745 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:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 822 transitions. [2019-09-08 12:29:00,808 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 822 transitions. Word has length 102 [2019-09-08 12:29:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:00,808 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 822 transitions. [2019-09-08 12:29:00,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 822 transitions. [2019-09-08 12:29:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:00,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:00,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:00,810 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:00,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1606100660, now seen corresponding path program 1 times [2019-09-08 12:29:00,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:00,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:00,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:00,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:00,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:01,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:01,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:01,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:01,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:01,024 INFO L87 Difference]: Start difference. First operand 646 states and 822 transitions. Second operand 9 states. [2019-09-08 12:29:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:03,369 INFO L93 Difference]: Finished difference Result 1093 states and 1409 transitions. [2019-09-08 12:29:03,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:03,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:03,370 INFO L225 Difference]: With dead ends: 1093 [2019-09-08 12:29:03,370 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:03,371 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:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 821 transitions. [2019-09-08 12:29:03,436 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 821 transitions. Word has length 102 [2019-09-08 12:29:03,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:03,436 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 821 transitions. [2019-09-08 12:29:03,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 821 transitions. [2019-09-08 12:29:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:03,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:03,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,438 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:03,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1991148821, now seen corresponding path program 1 times [2019-09-08 12:29:03,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:03,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:03,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:03,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:03,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:03,599 INFO L134 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:03,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:03,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:03,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:03,600 INFO L87 Difference]: Start difference. First operand 646 states and 821 transitions. Second operand 9 states. [2019-09-08 12:29:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:06,006 INFO L93 Difference]: Finished difference Result 1137 states and 1471 transitions. [2019-09-08 12:29:06,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:06,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:06,008 INFO L225 Difference]: With dead ends: 1137 [2019-09-08 12:29:06,008 INFO L226 Difference]: Without dead ends: 1120 [2019-09-08 12:29:06,008 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:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-08 12:29:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-08 12:29:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 820 transitions. [2019-09-08 12:29:06,073 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 820 transitions. Word has length 102 [2019-09-08 12:29:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:06,073 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 820 transitions. [2019-09-08 12:29:06,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 820 transitions. [2019-09-08 12:29:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:06,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:06,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] [2019-09-08 12:29:06,074 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:06,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:06,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1791700802, now seen corresponding path program 1 times [2019-09-08 12:29:06,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:06,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:06,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:06,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:06,226 INFO L134 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:06,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:06,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:06,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:06,227 INFO L87 Difference]: Start difference. First operand 646 states and 820 transitions. Second operand 9 states. [2019-09-08 12:29:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:08,565 INFO L93 Difference]: Finished difference Result 1093 states and 1407 transitions. [2019-09-08 12:29:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:08,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:08,568 INFO L225 Difference]: With dead ends: 1093 [2019-09-08 12:29:08,568 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:08,569 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:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 819 transitions. [2019-09-08 12:29:08,646 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 819 transitions. Word has length 102 [2019-09-08 12:29:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:08,647 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 819 transitions. [2019-09-08 12:29:08,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 819 transitions. [2019-09-08 12:29:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:08,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:08,648 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,648 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:08,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash -518117862, now seen corresponding path program 1 times [2019-09-08 12:29:08,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:08,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:08,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:08,793 INFO L134 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:08,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:08,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:08,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:08,794 INFO L87 Difference]: Start difference. First operand 646 states and 819 transitions. Second operand 9 states. [2019-09-08 12:29:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:11,184 INFO L93 Difference]: Finished difference Result 1165 states and 1513 transitions. [2019-09-08 12:29:11,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:11,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:11,186 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:29:11,186 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:11,187 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:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 818 transitions. [2019-09-08 12:29:11,255 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 818 transitions. Word has length 102 [2019-09-08 12:29:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:11,255 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 818 transitions. [2019-09-08 12:29:11,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 818 transitions. [2019-09-08 12:29:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:11,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:11,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,256 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:11,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:11,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1542160895, now seen corresponding path program 1 times [2019-09-08 12:29:11,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:11,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:11,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:11,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:11,413 INFO L134 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:11,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:11,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:11,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:11,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:11,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:11,415 INFO L87 Difference]: Start difference. First operand 646 states and 818 transitions. Second operand 9 states. [2019-09-08 12:29:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:13,866 INFO L93 Difference]: Finished difference Result 1168 states and 1515 transitions. [2019-09-08 12:29:13,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:13,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:13,868 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 12:29:13,868 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:13,869 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:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 817 transitions. [2019-09-08 12:29:13,943 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 817 transitions. Word has length 102 [2019-09-08 12:29:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:13,943 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 817 transitions. [2019-09-08 12:29:13,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2019-09-08 12:29:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:13,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:13,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,944 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:13,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1591591797, now seen corresponding path program 1 times [2019-09-08 12:29:13,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:13,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:13,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:13,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:13,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:14,094 INFO L134 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,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:14,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:14,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:14,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:14,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:14,096 INFO L87 Difference]: Start difference. First operand 646 states and 817 transitions. Second operand 9 states. [2019-09-08 12:29:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:16,482 INFO L93 Difference]: Finished difference Result 1168 states and 1514 transitions. [2019-09-08 12:29:16,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:16,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:16,484 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 12:29:16,484 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:16,484 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:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 816 transitions. [2019-09-08 12:29:16,554 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 816 transitions. Word has length 102 [2019-09-08 12:29:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:16,554 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 816 transitions. [2019-09-08 12:29:16,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 816 transitions. [2019-09-08 12:29:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:16,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:16,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,556 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:16,556 INFO L82 PathProgramCache]: Analyzing trace with hash -578717935, now seen corresponding path program 1 times [2019-09-08 12:29:16,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:16,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:16,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:16,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:16,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:16,689 INFO L134 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:16,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:16,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:16,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:16,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:16,690 INFO L87 Difference]: Start difference. First operand 646 states and 816 transitions. Second operand 9 states. [2019-09-08 12:29:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:18,773 INFO L93 Difference]: Finished difference Result 1165 states and 1509 transitions. [2019-09-08 12:29:18,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:18,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:18,774 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:29:18,775 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:18,775 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:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 815 transitions. [2019-09-08 12:29:18,850 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 815 transitions. Word has length 102 [2019-09-08 12:29:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:18,851 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 815 transitions. [2019-09-08 12:29:18,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 815 transitions. [2019-09-08 12:29:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:18,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:18,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,852 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1766002162, now seen corresponding path program 1 times [2019-09-08 12:29:18,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:18,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:18,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:18,980 INFO L134 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:18,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:18,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:18,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:18,981 INFO L87 Difference]: Start difference. First operand 646 states and 815 transitions. Second operand 9 states. [2019-09-08 12:29:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:21,299 INFO L93 Difference]: Finished difference Result 1165 states and 1508 transitions. [2019-09-08 12:29:21,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:21,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:21,301 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:29:21,301 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:21,302 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:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 814 transitions. [2019-09-08 12:29:21,373 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 814 transitions. Word has length 102 [2019-09-08 12:29:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:21,373 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 814 transitions. [2019-09-08 12:29:21,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 814 transitions. [2019-09-08 12:29:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:21,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:21,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,376 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash 86548545, now seen corresponding path program 1 times [2019-09-08 12:29:21,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:21,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:21,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:21,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:21,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:21,514 INFO L134 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:21,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:21,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:21,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:21,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:21,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:21,516 INFO L87 Difference]: Start difference. First operand 646 states and 814 transitions. Second operand 9 states. [2019-09-08 12:29:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:23,969 INFO L93 Difference]: Finished difference Result 1168 states and 1509 transitions. [2019-09-08 12:29:23,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:23,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:23,971 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 12:29:23,971 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:23,972 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:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:24,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 813 transitions. [2019-09-08 12:29:24,047 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 813 transitions. Word has length 102 [2019-09-08 12:29:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:24,048 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 813 transitions. [2019-09-08 12:29:24,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 813 transitions. [2019-09-08 12:29:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:24,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:24,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] [2019-09-08 12:29:24,049 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2083870417, now seen corresponding path program 1 times [2019-09-08 12:29:24,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:24,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:24,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:24,190 INFO L134 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:24,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:24,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:24,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:24,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:24,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:24,191 INFO L87 Difference]: Start difference. First operand 646 states and 813 transitions. Second operand 9 states. [2019-09-08 12:29:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:26,575 INFO L93 Difference]: Finished difference Result 1165 states and 1504 transitions. [2019-09-08 12:29:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:26,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:26,577 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:29:26,577 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:26,577 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:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 812 transitions. [2019-09-08 12:29:26,704 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 812 transitions. Word has length 102 [2019-09-08 12:29:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:26,704 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 812 transitions. [2019-09-08 12:29:26,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 812 transitions. [2019-09-08 12:29:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:26,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:26,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,706 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1805478129, now seen corresponding path program 1 times [2019-09-08 12:29:26,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:26,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:26,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:26,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:26,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:26,857 INFO L134 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:26,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:26,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:26,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:26,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:26,873 INFO L87 Difference]: Start difference. First operand 646 states and 812 transitions. Second operand 9 states. [2019-09-08 12:29:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:29,298 INFO L93 Difference]: Finished difference Result 1163 states and 1501 transitions. [2019-09-08 12:29:29,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:29,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:29,300 INFO L225 Difference]: With dead ends: 1163 [2019-09-08 12:29:29,300 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:29,301 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:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 811 transitions. [2019-09-08 12:29:29,376 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 811 transitions. Word has length 102 [2019-09-08 12:29:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:29,377 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 811 transitions. [2019-09-08 12:29:29,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 811 transitions. [2019-09-08 12:29:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:29,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:29,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,378 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:29,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1564380239, now seen corresponding path program 1 times [2019-09-08 12:29:29,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:29,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:29,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:29,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:29,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:29,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:29:29,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:29,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:29,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:29,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:29,530 INFO L87 Difference]: Start difference. First operand 646 states and 811 transitions. Second operand 9 states. [2019-09-08 12:29:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:31,752 INFO L93 Difference]: Finished difference Result 1165 states and 1501 transitions. [2019-09-08 12:29:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:31,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:31,754 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:29:31,754 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:31,755 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:31,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 810 transitions. [2019-09-08 12:29:31,833 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 810 transitions. Word has length 102 [2019-09-08 12:29:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:31,833 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 810 transitions. [2019-09-08 12:29:31,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 810 transitions. [2019-09-08 12:29:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:31,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:31,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,835 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:31,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1861566370, now seen corresponding path program 1 times [2019-09-08 12:29:31,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:31,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:31,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:31,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:31,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:32,013 INFO L134 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:32,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:32,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:32,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:32,015 INFO L87 Difference]: Start difference. First operand 646 states and 810 transitions. Second operand 9 states. [2019-09-08 12:29:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:34,261 INFO L93 Difference]: Finished difference Result 1163 states and 1497 transitions. [2019-09-08 12:29:34,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:34,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:34,262 INFO L225 Difference]: With dead ends: 1163 [2019-09-08 12:29:34,262 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:34,263 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:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 809 transitions. [2019-09-08 12:29:34,342 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 809 transitions. Word has length 102 [2019-09-08 12:29:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:34,342 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 809 transitions. [2019-09-08 12:29:34,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 809 transitions. [2019-09-08 12:29:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:34,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:34,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,343 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1799751695, now seen corresponding path program 1 times [2019-09-08 12:29:34,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:34,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:34,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:34,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:34,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:34,499 INFO L134 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:34,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:34,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:34,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:34,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:34,500 INFO L87 Difference]: Start difference. First operand 646 states and 809 transitions. Second operand 9 states. [2019-09-08 12:29:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:36,592 INFO L93 Difference]: Finished difference Result 1165 states and 1498 transitions. [2019-09-08 12:29:36,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:36,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:36,593 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:29:36,593 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:36,594 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:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 808 transitions. [2019-09-08 12:29:36,704 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 808 transitions. Word has length 102 [2019-09-08 12:29:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:36,704 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 808 transitions. [2019-09-08 12:29:36,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 808 transitions. [2019-09-08 12:29:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:36,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:36,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] [2019-09-08 12:29:36,706 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1222390320, now seen corresponding path program 1 times [2019-09-08 12:29:36,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:36,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:36,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:36,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:36,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:36,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:29:36,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:36,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:36,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:36,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:36,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:36,822 INFO L87 Difference]: Start difference. First operand 646 states and 808 transitions. Second operand 9 states. [2019-09-08 12:29:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:39,164 INFO L93 Difference]: Finished difference Result 1093 states and 1389 transitions. [2019-09-08 12:29:39,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:39,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:39,166 INFO L225 Difference]: With dead ends: 1093 [2019-09-08 12:29:39,166 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:39,167 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:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 807 transitions. [2019-09-08 12:29:39,247 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 807 transitions. Word has length 102 [2019-09-08 12:29:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:39,247 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 807 transitions. [2019-09-08 12:29:39,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 807 transitions. [2019-09-08 12:29:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:39,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:39,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,248 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash 418497365, now seen corresponding path program 1 times [2019-09-08 12:29:39,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:39,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:39,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:39,374 INFO L134 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,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:39,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:39,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:39,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:39,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:39,375 INFO L87 Difference]: Start difference. First operand 646 states and 807 transitions. Second operand 9 states. [2019-09-08 12:29:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:41,365 INFO L93 Difference]: Finished difference Result 1165 states and 1495 transitions. [2019-09-08 12:29:41,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:41,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:41,366 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 12:29:41,366 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:41,367 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:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 806 transitions. [2019-09-08 12:29:41,447 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 806 transitions. Word has length 102 [2019-09-08 12:29:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:41,447 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 806 transitions. [2019-09-08 12:29:41,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 806 transitions. [2019-09-08 12:29:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:41,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:41,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,448 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:41,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:41,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1905574170, now seen corresponding path program 1 times [2019-09-08 12:29:41,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:41,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:41,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:41,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:41,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:41,571 INFO L134 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,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:41,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:41,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:41,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:41,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:41,572 INFO L87 Difference]: Start difference. First operand 646 states and 806 transitions. Second operand 9 states. [2019-09-08 12:29:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:43,815 INFO L93 Difference]: Finished difference Result 1163 states and 1491 transitions. [2019-09-08 12:29:43,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:43,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:43,817 INFO L225 Difference]: With dead ends: 1163 [2019-09-08 12:29:43,817 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:43,817 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:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 805 transitions. [2019-09-08 12:29:43,915 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 805 transitions. Word has length 102 [2019-09-08 12:29:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:43,915 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 805 transitions. [2019-09-08 12:29:43,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 805 transitions. [2019-09-08 12:29:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:43,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:43,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,916 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1000695491, now seen corresponding path program 1 times [2019-09-08 12:29:43,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:43,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:43,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:43,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:43,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:44,036 INFO L134 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:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:44,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:44,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:44,037 INFO L87 Difference]: Start difference. First operand 646 states and 805 transitions. Second operand 9 states. [2019-09-08 12:29:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:46,315 INFO L93 Difference]: Finished difference Result 1164 states and 1491 transitions. [2019-09-08 12:29:46,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:46,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:46,317 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 12:29:46,317 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:29:46,318 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:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:29:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-08 12:29:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 12:29:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 804 transitions. [2019-09-08 12:29:46,411 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 804 transitions. Word has length 103 [2019-09-08 12:29:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:46,412 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 804 transitions. [2019-09-08 12:29:46,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 804 transitions. [2019-09-08 12:29:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:29:46,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:46,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,413 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1973611710, now seen corresponding path program 1 times [2019-09-08 12:29:46,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:46,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:46,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:47,501 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:29:47,646 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:29:47,798 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:29:49,302 INFO L134 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:49,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:49,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:29:49,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:29:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:29:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:29:49,304 INFO L87 Difference]: Start difference. First operand 646 states and 804 transitions. Second operand 31 states. [2019-09-08 12:29:49,498 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-08 12:29:50,632 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-08 12:29:50,811 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-08 12:29:51,266 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-08 12:29:51,599 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-09-08 12:29:51,970 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-09-08 12:29:52,391 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 89 [2019-09-08 12:29:52,921 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2019-09-08 12:29:53,214 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-09-08 12:29:53,510 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-09-08 12:29:53,832 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-09-08 12:30:05,616 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-08 12:30:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:07,295 INFO L93 Difference]: Finished difference Result 1336 states and 1683 transitions. [2019-09-08 12:30:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:30:07,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-08 12:30:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:07,297 INFO L225 Difference]: With dead ends: 1336 [2019-09-08 12:30:07,297 INFO L226 Difference]: Without dead ends: 1257 [2019-09-08 12:30:07,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:30:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-09-08 12:30:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 671. [2019-09-08 12:30:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-09-08 12:30:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 837 transitions. [2019-09-08 12:30:07,416 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 837 transitions. Word has length 104 [2019-09-08 12:30:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:07,416 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 837 transitions. [2019-09-08 12:30:07,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:30:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 837 transitions. [2019-09-08 12:30:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:07,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:07,417 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,417 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1671531983, now seen corresponding path program 1 times [2019-09-08 12:30:07,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:07,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:07,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:07,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:07,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:08,383 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:30:09,775 INFO L134 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:09,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:09,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:30:09,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:30:09,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:30:09,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:30:09,777 INFO L87 Difference]: Start difference. First operand 671 states and 837 transitions. Second operand 31 states. [2019-09-08 12:30:09,962 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 12:30:10,888 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 12:30:11,052 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:30:11,460 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 12:30:11,794 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-09-08 12:30:12,306 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-08 12:30:12,985 WARN L188 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 127 [2019-09-08 12:30:15,983 WARN L188 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 159 DAG size of output: 149 [2019-09-08 12:30:16,265 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-08 12:30:16,522 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-08 12:30:16,889 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-08 12:30:24,570 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 12:30:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:36,018 INFO L93 Difference]: Finished difference Result 2271 states and 2863 transitions. [2019-09-08 12:30:36,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:30:36,019 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-08 12:30:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:36,021 INFO L225 Difference]: With dead ends: 2271 [2019-09-08 12:30:36,021 INFO L226 Difference]: Without dead ends: 2189 [2019-09-08 12:30:36,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=581, Invalid=2959, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 12:30:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2019-09-08 12:30:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 680. [2019-09-08 12:30:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-08 12:30:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 849 transitions. [2019-09-08 12:30:36,184 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 849 transitions. Word has length 104 [2019-09-08 12:30:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:36,185 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 849 transitions. [2019-09-08 12:30:36,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:30:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 849 transitions. [2019-09-08 12:30:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:36,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:36,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,186 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:36,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:36,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1056682376, now seen corresponding path program 1 times [2019-09-08 12:30:36,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:36,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:36,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:36,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:36,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:36,946 INFO L134 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,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:36,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:30:36,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:30:36,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:30:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:30:36,948 INFO L87 Difference]: Start difference. First operand 680 states and 849 transitions. Second operand 17 states. [2019-09-08 12:30:37,567 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:30:37,710 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:30:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:41,224 INFO L93 Difference]: Finished difference Result 1359 states and 1744 transitions. [2019-09-08 12:30:41,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:30:41,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:30:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:41,226 INFO L225 Difference]: With dead ends: 1359 [2019-09-08 12:30:41,226 INFO L226 Difference]: Without dead ends: 1251 [2019-09-08 12:30:41,227 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:30:41,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-09-08 12:30:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 660. [2019-09-08 12:30:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 12:30:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 822 transitions. [2019-09-08 12:30:41,369 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 822 transitions. Word has length 104 [2019-09-08 12:30:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:41,369 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 822 transitions. [2019-09-08 12:30:41,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:30:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 822 transitions. [2019-09-08 12:30:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:41,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:41,371 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,371 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash -731627508, now seen corresponding path program 1 times [2019-09-08 12:30:41,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:41,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:41,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:41,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:42,701 INFO L134 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,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:42,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:30:42,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:30:42,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:30:42,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:30:42,703 INFO L87 Difference]: Start difference. First operand 660 states and 822 transitions. Second operand 22 states. [2019-09-08 12:30:43,783 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:30:44,054 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-08 12:30:44,439 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 12:30:44,589 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:30:44,974 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:30:45,339 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:30:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:49,797 INFO L93 Difference]: Finished difference Result 1362 states and 1730 transitions. [2019-09-08 12:30:49,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:30:49,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2019-09-08 12:30:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:49,799 INFO L225 Difference]: With dead ends: 1362 [2019-09-08 12:30:49,799 INFO L226 Difference]: Without dead ends: 1258 [2019-09-08 12:30:49,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:30:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-08 12:30:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 666. [2019-09-08 12:30:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 12:30:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 828 transitions. [2019-09-08 12:30:49,972 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 828 transitions. Word has length 104 [2019-09-08 12:30:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:49,973 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 828 transitions. [2019-09-08 12:30:49,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:30:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 828 transitions. [2019-09-08 12:30:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:49,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:49,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,974 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1599389865, now seen corresponding path program 1 times [2019-09-08 12:30:49,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:49,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:49,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:50,712 INFO L134 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:50,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:50,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:30:50,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:30:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:30:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:30:50,713 INFO L87 Difference]: Start difference. First operand 666 states and 828 transitions. Second operand 17 states. [2019-09-08 12:30:51,286 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:30:51,422 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:30:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:54,286 INFO L93 Difference]: Finished difference Result 1320 states and 1692 transitions. [2019-09-08 12:30:54,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:30:54,287 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:30:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:54,289 INFO L225 Difference]: With dead ends: 1320 [2019-09-08 12:30:54,289 INFO L226 Difference]: Without dead ends: 1225 [2019-09-08 12:30:54,290 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:30:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-08 12:30:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 659. [2019-09-08 12:30:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-08 12:30:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 817 transitions. [2019-09-08 12:30:54,451 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 817 transitions. Word has length 104 [2019-09-08 12:30:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:54,451 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 817 transitions. [2019-09-08 12:30:54,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:30:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 817 transitions. [2019-09-08 12:30:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:54,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:54,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,453 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash -356139567, now seen corresponding path program 1 times [2019-09-08 12:30:54,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:54,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:54,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:55,212 INFO L134 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:55,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:55,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:30:55,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:30:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:30:55,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:30:55,213 INFO L87 Difference]: Start difference. First operand 659 states and 817 transitions. Second operand 17 states. [2019-09-08 12:30:55,844 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:30:56,005 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:30:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:58,990 INFO L93 Difference]: Finished difference Result 1309 states and 1677 transitions. [2019-09-08 12:30:58,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:30:58,990 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:30:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:58,992 INFO L225 Difference]: With dead ends: 1309 [2019-09-08 12:30:58,992 INFO L226 Difference]: Without dead ends: 1219 [2019-09-08 12:30:58,993 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:30:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2019-09-08 12:30:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 653. [2019-09-08 12:30:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-08 12:30:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 807 transitions. [2019-09-08 12:30:59,197 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 807 transitions. Word has length 104 [2019-09-08 12:30:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:59,198 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 807 transitions. [2019-09-08 12:30:59,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:30:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 807 transitions. [2019-09-08 12:30:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:59,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:59,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,199 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2101815838, now seen corresponding path program 1 times [2019-09-08 12:30:59,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:59,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:00,034 INFO L134 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:00,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:00,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:31:00,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:31:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:31:00,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:31:00,035 INFO L87 Difference]: Start difference. First operand 653 states and 807 transitions. Second operand 16 states. [2019-09-08 12:31:00,750 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:31:00,901 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:31:01,051 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:31:01,241 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:31:01,409 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:31:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:05,192 INFO L93 Difference]: Finished difference Result 1181 states and 1450 transitions. [2019-09-08 12:31:05,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:31:05,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-08 12:31:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:05,194 INFO L225 Difference]: With dead ends: 1181 [2019-09-08 12:31:05,194 INFO L226 Difference]: Without dead ends: 1105 [2019-09-08 12:31:05,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:31:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-09-08 12:31:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 674. [2019-09-08 12:31:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-08 12:31:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 836 transitions. [2019-09-08 12:31:05,357 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 836 transitions. Word has length 104 [2019-09-08 12:31:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:05,357 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 836 transitions. [2019-09-08 12:31:05,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:31:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 836 transitions. [2019-09-08 12:31:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:31:05,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:05,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,359 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1657957713, now seen corresponding path program 1 times [2019-09-08 12:31:05,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:05,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:05,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:06,622 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:31:08,043 INFO L134 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:08,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:08,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:31:08,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:31:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:31:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:31:08,045 INFO L87 Difference]: Start difference. First operand 674 states and 836 transitions. Second operand 31 states. [2019-09-08 12:31:08,231 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 12:31:09,537 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 12:31:09,820 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-08 12:31:10,298 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-08 12:31:10,670 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-08 12:31:11,099 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-09-08 12:31:11,669 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2019-09-08 12:31:11,935 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-08 12:31:12,182 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-08 12:31:12,418 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 12:31:12,855 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 12:31:13,206 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 12:31:13,591 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 12:31:13,951 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-08 12:31:14,645 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 12:31:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:25,781 INFO L93 Difference]: Finished difference Result 1424 states and 1740 transitions. [2019-09-08 12:31:25,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:31:25,782 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-08 12:31:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:25,784 INFO L225 Difference]: With dead ends: 1424 [2019-09-08 12:31:25,784 INFO L226 Difference]: Without dead ends: 1418 [2019-09-08 12:31:25,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=655, Invalid=2315, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 12:31:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-09-08 12:31:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 684. [2019-09-08 12:31:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-09-08 12:31:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 847 transitions. [2019-09-08 12:31:25,951 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 847 transitions. Word has length 104 [2019-09-08 12:31:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:25,951 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 847 transitions. [2019-09-08 12:31:25,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:31:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 847 transitions. [2019-09-08 12:31:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:31:25,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:25,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:25,952 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1837373011, now seen corresponding path program 1 times [2019-09-08 12:31:25,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:25,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:25,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:26,673 INFO L134 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,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:26,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:31:26,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:31:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:31:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:31:26,674 INFO L87 Difference]: Start difference. First operand 684 states and 847 transitions. Second operand 17 states. [2019-09-08 12:31:27,291 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,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:29,695 INFO L93 Difference]: Finished difference Result 1390 states and 1778 transitions. [2019-09-08 12:31:29,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:31:29,695 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:31:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:29,697 INFO L225 Difference]: With dead ends: 1390 [2019-09-08 12:31:29,697 INFO L226 Difference]: Without dead ends: 1259 [2019-09-08 12:31:29,698 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:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2019-09-08 12:31:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 661. [2019-09-08 12:31:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-08 12:31:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 817 transitions. [2019-09-08 12:31:29,870 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 817 transitions. Word has length 104 [2019-09-08 12:31:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:29,870 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 817 transitions. [2019-09-08 12:31:29,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:31:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 817 transitions. [2019-09-08 12:31:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:31:29,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:29,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:29,871 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1726632168, now seen corresponding path program 1 times [2019-09-08 12:31:29,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:29,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:29,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:29,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:29,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:30,602 INFO L134 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,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:30,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:31:30,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:31:30,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:31:30,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:31:30,603 INFO L87 Difference]: Start difference. First operand 661 states and 817 transitions. Second operand 16 states. [2019-09-08 12:31:31,279 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:31:31,410 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:31:31,540 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:31:31,663 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-08 12:31:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:35,018 INFO L93 Difference]: Finished difference Result 1110 states and 1339 transitions. [2019-09-08 12:31:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:31:35,018 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-08 12:31:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:35,020 INFO L225 Difference]: With dead ends: 1110 [2019-09-08 12:31:35,020 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:31:35,021 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:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:31:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 679. [2019-09-08 12:31:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-08 12:31:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 841 transitions. [2019-09-08 12:31:35,179 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 841 transitions. Word has length 104 [2019-09-08 12:31:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:35,179 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 841 transitions. [2019-09-08 12:31:35,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:31:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 841 transitions. [2019-09-08 12:31:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:31:35,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:35,180 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,180 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:35,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1213486746, now seen corresponding path program 1 times [2019-09-08 12:31:35,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:35,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:35,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:35,866 INFO L134 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,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:31:35,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:31:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:31:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:31:35,867 INFO L87 Difference]: Start difference. First operand 679 states and 841 transitions. Second operand 16 states. [2019-09-08 12:31:36,544 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:31:36,681 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 12:31:36,813 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 12:31:36,946 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 12:31:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:40,271 INFO L93 Difference]: Finished difference Result 1161 states and 1429 transitions. [2019-09-08 12:31:40,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:31:40,271 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-08 12:31:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:40,273 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 12:31:40,273 INFO L226 Difference]: Without dead ends: 1085 [2019-09-08 12:31:40,274 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:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-08 12:31:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 683. [2019-09-08 12:31:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-08 12:31:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 846 transitions. [2019-09-08 12:31:40,460 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 846 transitions. Word has length 104 [2019-09-08 12:31:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:40,460 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 846 transitions. [2019-09-08 12:31:40,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:31:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 846 transitions. [2019-09-08 12:31:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:31:40,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:40,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,461 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:40,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1657511695, now seen corresponding path program 1 times [2019-09-08 12:31:40,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:40,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:40,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:41,673 INFO L134 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:41,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:41,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:31:41,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:31:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:31:41,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:31:41,674 INFO L87 Difference]: Start difference. First operand 683 states and 846 transitions. Second operand 22 states. [2019-09-08 12:31:42,656 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-08 12:31:42,922 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 12:31:43,221 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 12:31:43,387 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:31:43,650 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:31:43,911 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 12:31:44,253 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:31:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:47,414 INFO L93 Difference]: Finished difference Result 1408 states and 1774 transitions. [2019-09-08 12:31:47,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:31:47,414 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2019-09-08 12:31:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:47,416 INFO L225 Difference]: With dead ends: 1408 [2019-09-08 12:31:47,416 INFO L226 Difference]: Without dead ends: 1258 [2019-09-08 12:31:47,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:31:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-08 12:31:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 695. [2019-09-08 12:31:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-09-08 12:31:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 858 transitions. [2019-09-08 12:31:47,608 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 858 transitions. Word has length 104 [2019-09-08 12:31:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:47,608 INFO L475 AbstractCegarLoop]: Abstraction has 695 states and 858 transitions. [2019-09-08 12:31:47,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:31:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 858 transitions. [2019-09-08 12:31:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:31:47,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:47,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, 1] [2019-09-08 12:31:47,609 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1499785276, now seen corresponding path program 1 times [2019-09-08 12:31:47,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:47,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:47,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:47,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:47,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:48,634 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:31:48,782 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-08 12:31:49,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:49,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:49,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 12:31:49,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 12:31:49,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 12:31:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:31:49,915 INFO L87 Difference]: Start difference. First operand 695 states and 858 transitions. Second operand 30 states. [2019-09-08 12:31:50,112 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-08 12:31:50,993 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:31:51,160 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 12:31:51,427 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:31:51,857 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-08 12:31:52,187 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-08 12:31:52,563 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-08 12:31:53,008 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-09-08 12:31:53,280 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-08 12:31:53,551 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-08 12:31:53,827 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-08 12:31:54,055 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-08 12:31:54,304 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-08 12:31:54,662 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:32:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:06,223 INFO L93 Difference]: Finished difference Result 1590 states and 1977 transitions. [2019-09-08 12:32:06,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:32:06,223 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 104 [2019-09-08 12:32:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:06,225 INFO L225 Difference]: With dead ends: 1590 [2019-09-08 12:32:06,225 INFO L226 Difference]: Without dead ends: 1486 [2019-09-08 12:32:06,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:32:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2019-09-08 12:32:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 711. [2019-09-08 12:32:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-09-08 12:32:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 876 transitions. [2019-09-08 12:32:06,428 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 876 transitions. Word has length 104 [2019-09-08 12:32:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:06,428 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 876 transitions. [2019-09-08 12:32:06,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 12:32:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 876 transitions. [2019-09-08 12:32:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:32:06,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:06,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,429 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash -464164647, now seen corresponding path program 1 times [2019-09-08 12:32:06,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:06,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:06,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:06,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:06,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:07,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:07,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:32:07,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:32:07,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:32:07,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:32:07,382 INFO L87 Difference]: Start difference. First operand 711 states and 876 transitions. Second operand 20 states. [2019-09-08 12:32:08,332 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-08 12:32:08,561 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 12:32:08,730 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:32:08,894 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:32:09,053 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-08 12:32:09,185 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 12:32:09,325 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 12:32:09,551 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 12:32:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:13,660 INFO L93 Difference]: Finished difference Result 1508 states and 1874 transitions. [2019-09-08 12:32:13,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:32:13,661 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-08 12:32:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:13,662 INFO L225 Difference]: With dead ends: 1508 [2019-09-08 12:32:13,663 INFO L226 Difference]: Without dead ends: 1313 [2019-09-08 12:32:13,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:32:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-09-08 12:32:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 701. [2019-09-08 12:32:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-09-08 12:32:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 864 transitions. [2019-09-08 12:32:13,857 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 864 transitions. Word has length 104 [2019-09-08 12:32:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:13,857 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 864 transitions. [2019-09-08 12:32:13,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:32:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 864 transitions. [2019-09-08 12:32:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:32:13,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:13,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,858 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:13,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1008248256, now seen corresponding path program 1 times [2019-09-08 12:32:13,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:13,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:13,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:13,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:13,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:14,588 INFO L134 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:14,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:14,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:32:14,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:32:14,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:32:14,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:32:14,590 INFO L87 Difference]: Start difference. First operand 701 states and 864 transitions. Second operand 17 states. [2019-09-08 12:32:15,238 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:32:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:19,246 INFO L93 Difference]: Finished difference Result 1291 states and 1646 transitions. [2019-09-08 12:32:19,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:32:19,246 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:32:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:19,248 INFO L225 Difference]: With dead ends: 1291 [2019-09-08 12:32:19,248 INFO L226 Difference]: Without dead ends: 1215 [2019-09-08 12:32:19,249 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:32:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-09-08 12:32:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 701. [2019-09-08 12:32:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-09-08 12:32:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 862 transitions. [2019-09-08 12:32:19,443 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 862 transitions. Word has length 104 [2019-09-08 12:32:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:19,443 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 862 transitions. [2019-09-08 12:32:19,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:32:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 862 transitions. [2019-09-08 12:32:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:32:19,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:19,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:19,445 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1599888547, now seen corresponding path program 1 times [2019-09-08 12:32:19,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:19,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:20,461 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 12:32:21,265 INFO L134 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:21,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:21,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-08 12:32:21,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 12:32:21,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 12:32:21,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:32:21,267 INFO L87 Difference]: Start difference. First operand 701 states and 862 transitions. Second operand 27 states. [2019-09-08 12:32:21,411 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 12:32:22,102 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-08 12:32:22,340 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 12:32:22,882 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-08 12:32:23,212 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-08 12:32:23,590 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-08 12:32:24,231 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-08 12:32:24,448 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:32:24,775 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 12:32:25,026 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:32:25,318 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:32:25,587 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:32:26,037 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:32:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:33,195 INFO L93 Difference]: Finished difference Result 1335 states and 1681 transitions. [2019-09-08 12:32:33,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:32:33,195 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-09-08 12:32:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:33,196 INFO L225 Difference]: With dead ends: 1335 [2019-09-08 12:32:33,197 INFO L226 Difference]: Without dead ends: 1257 [2019-09-08 12:32:33,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:32:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-09-08 12:32:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 712. [2019-09-08 12:32:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-08 12:32:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 874 transitions. [2019-09-08 12:32:33,410 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 874 transitions. Word has length 104 [2019-09-08 12:32:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:33,410 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 874 transitions. [2019-09-08 12:32:33,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 12:32:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 874 transitions. [2019-09-08 12:32:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:32:33,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:33,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,412 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1392964829, now seen corresponding path program 1 times [2019-09-08 12:32:33,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:33,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:33,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:33,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:34,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:34,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:32:34,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:32:34,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:32:34,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:32:34,116 INFO L87 Difference]: Start difference. First operand 712 states and 874 transitions. Second operand 17 states. [2019-09-08 12:32:34,787 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:32:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:39,440 INFO L93 Difference]: Finished difference Result 1302 states and 1655 transitions. [2019-09-08 12:32:39,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:32:39,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:32:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:39,442 INFO L225 Difference]: With dead ends: 1302 [2019-09-08 12:32:39,442 INFO L226 Difference]: Without dead ends: 1224 [2019-09-08 12:32:39,442 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:32:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-08 12:32:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 712. [2019-09-08 12:32:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-08 12:32:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 872 transitions. [2019-09-08 12:32:39,675 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 872 transitions. Word has length 104 [2019-09-08 12:32:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:39,676 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 872 transitions. [2019-09-08 12:32:39,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:32:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 872 transitions. [2019-09-08 12:32:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:32:39,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:39,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,677 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1748743276, now seen corresponding path program 1 times [2019-09-08 12:32:39,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:39,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:39,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:39,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:39,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:40,737 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:32:41,613 INFO L134 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,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:41,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-08 12:32:41,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 12:32:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 12:32:41,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:32:41,614 INFO L87 Difference]: Start difference. First operand 712 states and 872 transitions. Second operand 27 states. [2019-09-08 12:32:41,765 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-08 12:32:42,663 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-08 12:32:43,206 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-08 12:32:43,528 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 12:32:43,919 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-08 12:32:44,361 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-08 12:32:44,572 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:32:44,831 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-08 12:32:45,073 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-08 12:32:45,311 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:32:45,547 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:32:45,956 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:32:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:52,371 INFO L93 Difference]: Finished difference Result 1340 states and 1678 transitions. [2019-09-08 12:32:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:32:52,372 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-09-08 12:32:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:52,373 INFO L225 Difference]: With dead ends: 1340 [2019-09-08 12:32:52,373 INFO L226 Difference]: Without dead ends: 1245 [2019-09-08 12:32:52,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:32:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2019-09-08 12:32:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 723. [2019-09-08 12:32:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-09-08 12:32:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 884 transitions. [2019-09-08 12:32:52,606 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 884 transitions. Word has length 104 [2019-09-08 12:32:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:52,606 INFO L475 AbstractCegarLoop]: Abstraction has 723 states and 884 transitions. [2019-09-08 12:32:52,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 12:32:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 884 transitions. [2019-09-08 12:32:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:32:52,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:52,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,608 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:52,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash 88268615, now seen corresponding path program 1 times [2019-09-08 12:32:52,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:52,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:52,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:53,364 INFO L134 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:53,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:53,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:32:53,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:32:53,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:32:53,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:32:53,365 INFO L87 Difference]: Start difference. First operand 723 states and 884 transitions. Second operand 17 states. [2019-09-08 12:32:53,975 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:32:54,125 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:32:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:56,060 INFO L93 Difference]: Finished difference Result 1322 states and 1674 transitions. [2019-09-08 12:32:56,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:32:56,061 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-08 12:32:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:56,063 INFO L225 Difference]: With dead ends: 1322 [2019-09-08 12:32:56,063 INFO L226 Difference]: Without dead ends: 1137 [2019-09-08 12:32:56,064 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:32:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-08 12:32:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 659. [2019-09-08 12:32:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-08 12:32:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 804 transitions. [2019-09-08 12:32:56,278 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 804 transitions. Word has length 104 [2019-09-08 12:32:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:56,278 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 804 transitions. [2019-09-08 12:32:56,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:32:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 804 transitions. [2019-09-08 12:32:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:32:56,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:56,279 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:56,280 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1710464, now seen corresponding path program 1 times [2019-09-08 12:32:56,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:56,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:56,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:56,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:32:56,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:56,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:56,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:56,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:56,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:56,405 INFO L87 Difference]: Start difference. First operand 659 states and 804 transitions. Second operand 9 states. [2019-09-08 12:32:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:58,572 INFO L93 Difference]: Finished difference Result 1063 states and 1333 transitions. [2019-09-08 12:32:58,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:58,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:32:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:58,574 INFO L225 Difference]: With dead ends: 1063 [2019-09-08 12:32:58,574 INFO L226 Difference]: Without dead ends: 1056 [2019-09-08 12:32:58,574 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:32:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-09-08 12:32:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 659. [2019-09-08 12:32:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-08 12:32:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2019-09-08 12:32:58,797 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 802 transitions. Word has length 105 [2019-09-08 12:32:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:58,797 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 802 transitions. [2019-09-08 12:32:58,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 802 transitions. [2019-09-08 12:32:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:32:58,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:58,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,798 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1026369323, now seen corresponding path program 1 times [2019-09-08 12:32:58,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:58,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:58,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:58,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:58,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:58,931 INFO L134 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,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:58,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:58,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:58,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:58,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:58,932 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. Second operand 9 states. [2019-09-08 12:33:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:01,051 INFO L93 Difference]: Finished difference Result 1178 states and 1495 transitions. [2019-09-08 12:33:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:01,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:33:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:01,053 INFO L225 Difference]: With dead ends: 1178 [2019-09-08 12:33:01,053 INFO L226 Difference]: Without dead ends: 1085 [2019-09-08 12:33:01,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-08 12:33:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 659. [2019-09-08 12:33:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-08 12:33:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 800 transitions. [2019-09-08 12:33:01,285 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 800 transitions. Word has length 105 [2019-09-08 12:33:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:01,285 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 800 transitions. [2019-09-08 12:33:01,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 800 transitions. [2019-09-08 12:33:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:01,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:01,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,286 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1566388671, now seen corresponding path program 1 times [2019-09-08 12:33:01,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:01,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:01,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:01,671 INFO L134 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:01,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:01,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:33:01,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:33:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:33:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:33:01,672 INFO L87 Difference]: Start difference. First operand 659 states and 800 transitions. Second operand 11 states. [2019-09-08 12:33:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:03,783 INFO L93 Difference]: Finished difference Result 1660 states and 2147 transitions. [2019-09-08 12:33:03,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:33:03,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-08 12:33:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:03,785 INFO L225 Difference]: With dead ends: 1660 [2019-09-08 12:33:03,786 INFO L226 Difference]: Without dead ends: 1563 [2019-09-08 12:33:03,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:33:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-09-08 12:33:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 637. [2019-09-08 12:33:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-08 12:33:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 775 transitions. [2019-09-08 12:33:03,986 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 775 transitions. Word has length 105 [2019-09-08 12:33:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:03,986 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 775 transitions. [2019-09-08 12:33:03,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:33:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 775 transitions. [2019-09-08 12:33:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:03,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:03,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,987 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:03,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:03,988 INFO L82 PathProgramCache]: Analyzing trace with hash 426480591, now seen corresponding path program 1 times [2019-09-08 12:33:03,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:03,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:03,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:03,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:04,577 INFO L134 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:04,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:04,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:33:04,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:33:04,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:33:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:33:04,578 INFO L87 Difference]: Start difference. First operand 637 states and 775 transitions. Second operand 16 states. [2019-09-08 12:33:05,524 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 12:33:06,329 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 12:33:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:09,014 INFO L93 Difference]: Finished difference Result 1364 states and 1758 transitions. [2019-09-08 12:33:09,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:33:09,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-08 12:33:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:09,015 INFO L225 Difference]: With dead ends: 1364 [2019-09-08 12:33:09,015 INFO L226 Difference]: Without dead ends: 1273 [2019-09-08 12:33:09,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:33:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-09-08 12:33:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 643. [2019-09-08 12:33:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 12:33:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 782 transitions. [2019-09-08 12:33:09,218 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 782 transitions. Word has length 105 [2019-09-08 12:33:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:09,218 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 782 transitions. [2019-09-08 12:33:09,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:33:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 782 transitions. [2019-09-08 12:33:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:09,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:09,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,219 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash -491192768, now seen corresponding path program 1 times [2019-09-08 12:33:09,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:09,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:09,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:09,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:09,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:10,437 INFO L134 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:10,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:10,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:33:10,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:33:10,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:33:10,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:10,438 INFO L87 Difference]: Start difference. First operand 643 states and 782 transitions. Second operand 21 states. [2019-09-08 12:33:11,508 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2019-09-08 12:33:11,774 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-09-08 12:33:11,980 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-08 12:33:12,191 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-08 12:33:16,598 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-08 12:33:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:17,912 INFO L93 Difference]: Finished difference Result 1147 states and 1404 transitions. [2019-09-08 12:33:17,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:33:17,913 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-08 12:33:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:17,914 INFO L225 Difference]: With dead ends: 1147 [2019-09-08 12:33:17,914 INFO L226 Difference]: Without dead ends: 1068 [2019-09-08 12:33:17,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=247, Invalid=1085, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:33:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-09-08 12:33:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 644. [2019-09-08 12:33:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-08 12:33:18,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 784 transitions. [2019-09-08 12:33:18,124 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 784 transitions. Word has length 105 [2019-09-08 12:33:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:18,124 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 784 transitions. [2019-09-08 12:33:18,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:33:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 784 transitions. [2019-09-08 12:33:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:18,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:18,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,126 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:18,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:18,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1169420094, now seen corresponding path program 1 times [2019-09-08 12:33:18,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:18,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:18,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:18,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:18,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:33:18,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:33:18,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:33:18,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:33:18,803 INFO L87 Difference]: Start difference. First operand 644 states and 784 transitions. Second operand 17 states. [2019-09-08 12:33:19,400 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:33:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:21,484 INFO L93 Difference]: Finished difference Result 1182 states and 1504 transitions. [2019-09-08 12:33:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:33:21,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 105 [2019-09-08 12:33:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:21,486 INFO L225 Difference]: With dead ends: 1182 [2019-09-08 12:33:21,486 INFO L226 Difference]: Without dead ends: 1066 [2019-09-08 12:33:21,486 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:33:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-09-08 12:33:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 621. [2019-09-08 12:33:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 12:33:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 757 transitions. [2019-09-08 12:33:21,719 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 757 transitions. Word has length 105 [2019-09-08 12:33:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:21,719 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 757 transitions. [2019-09-08 12:33:21,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:33:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 757 transitions. [2019-09-08 12:33:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:21,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:21,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,721 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1010302235, now seen corresponding path program 1 times [2019-09-08 12:33:21,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:21,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:21,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:22,830 INFO L134 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:22,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:33:22,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:33:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:33:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:22,831 INFO L87 Difference]: Start difference. First operand 621 states and 757 transitions. Second operand 21 states. [2019-09-08 12:33:23,856 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:33:24,110 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 12:33:24,288 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:33:24,462 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:33:24,667 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 12:33:28,790 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 12:33:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:29,546 INFO L93 Difference]: Finished difference Result 1090 states and 1333 transitions. [2019-09-08 12:33:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:33:29,547 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-08 12:33:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:29,548 INFO L225 Difference]: With dead ends: 1090 [2019-09-08 12:33:29,548 INFO L226 Difference]: Without dead ends: 1011 [2019-09-08 12:33:29,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:33:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-09-08 12:33:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 637. [2019-09-08 12:33:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-08 12:33:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 777 transitions. [2019-09-08 12:33:29,765 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 777 transitions. Word has length 105 [2019-09-08 12:33:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:29,765 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 777 transitions. [2019-09-08 12:33:29,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:33:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 777 transitions. [2019-09-08 12:33:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:29,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:29,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,766 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash 556450702, now seen corresponding path program 1 times [2019-09-08 12:33:29,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:29,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:29,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:29,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:29,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:30,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:30,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:33:30,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:33:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:33:30,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:33:30,103 INFO L87 Difference]: Start difference. First operand 637 states and 777 transitions. Second operand 11 states. [2019-09-08 12:33:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:31,971 INFO L93 Difference]: Finished difference Result 1493 states and 1978 transitions. [2019-09-08 12:33:31,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:31,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-08 12:33:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:31,974 INFO L225 Difference]: With dead ends: 1493 [2019-09-08 12:33:31,974 INFO L226 Difference]: Without dead ends: 1407 [2019-09-08 12:33:31,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:33:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2019-09-08 12:33:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 626. [2019-09-08 12:33:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 12:33:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 762 transitions. [2019-09-08 12:33:32,211 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 762 transitions. Word has length 105 [2019-09-08 12:33:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:32,211 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 762 transitions. [2019-09-08 12:33:32,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:33:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 762 transitions. [2019-09-08 12:33:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:32,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:32,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,213 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash 593307121, now seen corresponding path program 1 times [2019-09-08 12:33:32,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:32,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:32,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:33,271 INFO L134 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:33,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:33,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:33:33,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:33:33,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:33:33,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:33,272 INFO L87 Difference]: Start difference. First operand 626 states and 762 transitions. Second operand 21 states. [2019-09-08 12:33:34,237 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:33:34,526 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-08 12:33:34,687 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:33:34,831 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:33:34,981 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 12:33:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:40,226 INFO L93 Difference]: Finished difference Result 1162 states and 1400 transitions. [2019-09-08 12:33:40,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:33:40,226 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-08 12:33:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:40,228 INFO L225 Difference]: With dead ends: 1162 [2019-09-08 12:33:40,228 INFO L226 Difference]: Without dead ends: 1156 [2019-09-08 12:33:40,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:33:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-09-08 12:33:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 626. [2019-09-08 12:33:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 12:33:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 761 transitions. [2019-09-08 12:33:40,449 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 761 transitions. Word has length 105 [2019-09-08 12:33:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:40,450 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 761 transitions. [2019-09-08 12:33:40,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:33:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 761 transitions. [2019-09-08 12:33:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:40,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:40,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,451 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1230801955, now seen corresponding path program 1 times [2019-09-08 12:33:40,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:40,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:40,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:40,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:40,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:41,171 INFO L134 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:41,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:41,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:33:41,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:33:41,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:33:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:33:41,172 INFO L87 Difference]: Start difference. First operand 626 states and 761 transitions. Second operand 16 states. [2019-09-08 12:33:41,887 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:33:42,046 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:33:42,220 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:33:42,407 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:33:42,573 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:33:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:45,978 INFO L93 Difference]: Finished difference Result 1064 states and 1301 transitions. [2019-09-08 12:33:45,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:33:45,978 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-08 12:33:45,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:45,980 INFO L225 Difference]: With dead ends: 1064 [2019-09-08 12:33:45,980 INFO L226 Difference]: Without dead ends: 988 [2019-09-08 12:33:45,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:33:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-09-08 12:33:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 636. [2019-09-08 12:33:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-08 12:33:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 774 transitions. [2019-09-08 12:33:46,201 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 774 transitions. Word has length 105 [2019-09-08 12:33:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:46,201 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 774 transitions. [2019-09-08 12:33:46,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:33:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 774 transitions. [2019-09-08 12:33:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:46,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:46,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,202 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1674768317, now seen corresponding path program 1 times [2019-09-08 12:33:46,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:46,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:46,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:46,823 INFO L134 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:46,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:46,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:33:46,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:33:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:33:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:33:46,824 INFO L87 Difference]: Start difference. First operand 636 states and 774 transitions. Second operand 17 states. [2019-09-08 12:33:47,456 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-08 12:33:47,623 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:33:47,790 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:33:48,016 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:33:48,249 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 12:33:48,603 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-08 12:33:48,899 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-08 12:33:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:50,924 INFO L93 Difference]: Finished difference Result 1596 states and 2073 transitions. [2019-09-08 12:33:50,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:33:50,927 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 105 [2019-09-08 12:33:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:50,929 INFO L225 Difference]: With dead ends: 1596 [2019-09-08 12:33:50,929 INFO L226 Difference]: Without dead ends: 1487 [2019-09-08 12:33:50,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:33:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-08 12:33:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 600. [2019-09-08 12:33:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-08 12:33:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 728 transitions. [2019-09-08 12:33:51,148 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 728 transitions. Word has length 105 [2019-09-08 12:33:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:51,148 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 728 transitions. [2019-09-08 12:33:51,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:33:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 728 transitions. [2019-09-08 12:33:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:51,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:51,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:51,149 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash 390784349, now seen corresponding path program 1 times [2019-09-08 12:33:51,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:51,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:51,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:51,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:51,598 INFO L134 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,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:51,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:33:51,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:33:51,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:33:51,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:33:51,599 INFO L87 Difference]: Start difference. First operand 600 states and 728 transitions. Second operand 12 states. [2019-09-08 12:33:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:53,150 INFO L93 Difference]: Finished difference Result 1266 states and 1629 transitions. [2019-09-08 12:33:53,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:33:53,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2019-09-08 12:33:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:53,151 INFO L225 Difference]: With dead ends: 1266 [2019-09-08 12:33:53,151 INFO L226 Difference]: Without dead ends: 1064 [2019-09-08 12:33:53,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:33:53,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-09-08 12:33:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 472. [2019-09-08 12:33:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 12:33:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 576 transitions. [2019-09-08 12:33:53,335 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 576 transitions. Word has length 105 [2019-09-08 12:33:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:53,335 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 576 transitions. [2019-09-08 12:33:53,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:33:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 576 transitions. [2019-09-08 12:33:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:53,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:53,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, 1, 1, 1] [2019-09-08 12:33:53,336 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2094054007, now seen corresponding path program 1 times [2019-09-08 12:33:53,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:53,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:53,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:53,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:33:53,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:53,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:33:53,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:33:53,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:33:53,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:33:53,970 INFO L87 Difference]: Start difference. First operand 472 states and 576 transitions. Second operand 16 states. [2019-09-08 12:33:54,621 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:33:54,866 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:33:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:57,299 INFO L93 Difference]: Finished difference Result 827 states and 1025 transitions. [2019-09-08 12:33:57,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:33:57,300 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-08 12:33:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:57,301 INFO L225 Difference]: With dead ends: 827 [2019-09-08 12:33:57,301 INFO L226 Difference]: Without dead ends: 748 [2019-09-08 12:33:57,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:33:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-08 12:33:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 479. [2019-09-08 12:33:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-08 12:33:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 585 transitions. [2019-09-08 12:33:57,492 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 585 transitions. Word has length 105 [2019-09-08 12:33:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:57,492 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 585 transitions. [2019-09-08 12:33:57,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:33:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 585 transitions. [2019-09-08 12:33:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:33:57,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:57,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,493 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash 238920912, now seen corresponding path program 1 times [2019-09-08 12:33:57,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:57,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:57,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:57,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:57,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:58,111 INFO L134 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,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:58,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:33:58,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:33:58,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:33:58,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:33:58,112 INFO L87 Difference]: Start difference. First operand 479 states and 585 transitions. Second operand 15 states. [2019-09-08 12:34:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:00,740 INFO L93 Difference]: Finished difference Result 1116 states and 1448 transitions. [2019-09-08 12:34:00,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:34:00,741 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2019-09-08 12:34:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:00,743 INFO L225 Difference]: With dead ends: 1116 [2019-09-08 12:34:00,743 INFO L226 Difference]: Without dead ends: 915 [2019-09-08 12:34:00,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:34:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-08 12:34:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 418. [2019-09-08 12:34:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-08 12:34:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 511 transitions. [2019-09-08 12:34:00,934 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 511 transitions. Word has length 105 [2019-09-08 12:34:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:00,935 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 511 transitions. [2019-09-08 12:34:00,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:34:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 511 transitions. [2019-09-08 12:34:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:34:00,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:00,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,936 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1983508514, now seen corresponding path program 1 times [2019-09-08 12:34:00,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:00,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:00,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:01,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:01,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:34:01,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:34:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:34:01,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:34:01,300 INFO L87 Difference]: Start difference. First operand 418 states and 511 transitions. Second operand 11 states. [2019-09-08 12:34:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:02,809 INFO L93 Difference]: Finished difference Result 901 states and 1170 transitions. [2019-09-08 12:34:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:02,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-08 12:34:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:02,811 INFO L225 Difference]: With dead ends: 901 [2019-09-08 12:34:02,811 INFO L226 Difference]: Without dead ends: 702 [2019-09-08 12:34:02,812 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:34:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-08 12:34:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 294. [2019-09-08 12:34:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-08 12:34:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 355 transitions. [2019-09-08 12:34:02,965 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 355 transitions. Word has length 105 [2019-09-08 12:34:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:02,966 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 355 transitions. [2019-09-08 12:34:02,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:34:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 355 transitions. [2019-09-08 12:34:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:34:02,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:02,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,966 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash -137973323, now seen corresponding path program 1 times [2019-09-08 12:34:02,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:02,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:02,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:02,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:02,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:03,576 INFO L134 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:03,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:03,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:34:03,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:34:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:34:03,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:34:03,577 INFO L87 Difference]: Start difference. First operand 294 states and 355 transitions. Second operand 13 states. [2019-09-08 12:34:03,880 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-09-08 12:34:04,323 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-08 12:34:04,510 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-08 12:34:04,842 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-09-08 12:34:05,030 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-09-08 12:34:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:06,518 INFO L93 Difference]: Finished difference Result 1125 states and 1546 transitions. [2019-09-08 12:34:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:34:06,518 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2019-09-08 12:34:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:06,520 INFO L225 Difference]: With dead ends: 1125 [2019-09-08 12:34:06,520 INFO L226 Difference]: Without dead ends: 1030 [2019-09-08 12:34:06,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:34:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-08 12:34:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 250. [2019-09-08 12:34:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-08 12:34:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 302 transitions. [2019-09-08 12:34:06,657 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 302 transitions. Word has length 105 [2019-09-08 12:34:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:06,657 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 302 transitions. [2019-09-08 12:34:06,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:34:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2019-09-08 12:34:06,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:34:06,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:06,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,658 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1986237959, now seen corresponding path program 1 times [2019-09-08 12:34:06,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:06,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:06,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:06,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:06,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:06,778 INFO L134 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,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:06,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:06,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:06,779 INFO L87 Difference]: Start difference. First operand 250 states and 302 transitions. Second operand 9 states. [2019-09-08 12:34:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:08,190 INFO L93 Difference]: Finished difference Result 529 states and 691 transitions. [2019-09-08 12:34:08,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:08,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-09-08 12:34:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:08,191 INFO L225 Difference]: With dead ends: 529 [2019-09-08 12:34:08,192 INFO L226 Difference]: Without dead ends: 522 [2019-09-08 12:34:08,192 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:34:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-08 12:34:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 250. [2019-09-08 12:34:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-08 12:34:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 300 transitions. [2019-09-08 12:34:08,314 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 300 transitions. Word has length 106 [2019-09-08 12:34:08,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:08,314 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 300 transitions. [2019-09-08 12:34:08,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 300 transitions. [2019-09-08 12:34:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:34:08,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:08,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,315 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:08,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:08,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1571558324, now seen corresponding path program 1 times [2019-09-08 12:34:08,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:08,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:08,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:08,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:08,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:08,682 INFO L134 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:08,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:08,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:34:08,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:34:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:34:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:34:08,683 INFO L87 Difference]: Start difference. First operand 250 states and 300 transitions. Second operand 11 states. [2019-09-08 12:34:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:09,634 INFO L93 Difference]: Finished difference Result 649 states and 853 transitions. [2019-09-08 12:34:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:34:09,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2019-09-08 12:34:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:09,635 INFO L225 Difference]: With dead ends: 649 [2019-09-08 12:34:09,636 INFO L226 Difference]: Without dead ends: 530 [2019-09-08 12:34:09,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:34:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-08 12:34:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 195. [2019-09-08 12:34:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-08 12:34:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 237 transitions. [2019-09-08 12:34:09,754 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 237 transitions. Word has length 106 [2019-09-08 12:34:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:09,754 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 237 transitions. [2019-09-08 12:34:09,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:34:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 237 transitions. [2019-09-08 12:34:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:34:09,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:09,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,755 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:09,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1740537637, now seen corresponding path program 1 times [2019-09-08 12:34:09,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:09,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:09,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:10,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:34:10,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:34:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:34:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:10,732 INFO L87 Difference]: Start difference. First operand 195 states and 237 transitions. Second operand 21 states. [2019-09-08 12:34:11,652 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 12:34:11,840 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-08 12:34:12,004 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:34:12,163 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:34:13,045 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 12:34:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:15,638 INFO L93 Difference]: Finished difference Result 853 states and 1156 transitions. [2019-09-08 12:34:15,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:34:15,638 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-09-08 12:34:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:15,639 INFO L225 Difference]: With dead ends: 853 [2019-09-08 12:34:15,640 INFO L226 Difference]: Without dead ends: 847 [2019-09-08 12:34:15,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:34:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-08 12:34:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 224. [2019-09-08 12:34:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-08 12:34:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 272 transitions. [2019-09-08 12:34:15,761 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 272 transitions. Word has length 107 [2019-09-08 12:34:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:15,761 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 272 transitions. [2019-09-08 12:34:15,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:34:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 272 transitions. [2019-09-08 12:34:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:34:15,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:15,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:15,762 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash -755651892, now seen corresponding path program 1 times [2019-09-08 12:34:15,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:15,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:15,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:15,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:15,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:16,416 INFO L134 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:16,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:16,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:34:16,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:34:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:34:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:34:16,417 INFO L87 Difference]: Start difference. First operand 224 states and 272 transitions. Second operand 16 states. [2019-09-08 12:34:17,065 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:34:17,316 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:34:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:18,998 INFO L93 Difference]: Finished difference Result 687 states and 922 transitions. [2019-09-08 12:34:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:34:18,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-08 12:34:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:18,999 INFO L225 Difference]: With dead ends: 687 [2019-09-08 12:34:18,999 INFO L226 Difference]: Without dead ends: 681 [2019-09-08 12:34:19,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:34:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-08 12:34:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 225. [2019-09-08 12:34:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-08 12:34:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 273 transitions. [2019-09-08 12:34:19,123 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 273 transitions. Word has length 108 [2019-09-08 12:34:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:19,123 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 273 transitions. [2019-09-08 12:34:19,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:34:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 273 transitions. [2019-09-08 12:34:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:34:19,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:19,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,124 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash -398163250, now seen corresponding path program 1 times [2019-09-08 12:34:19,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:19,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:19,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:19,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:19,949 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-08 12:34:20,083 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-08 12:34:20,218 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:34:22,224 INFO L134 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:22,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:34:22,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:34:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:34:22,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=968, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:34:22,225 INFO L87 Difference]: Start difference. First operand 225 states and 273 transitions. Second operand 33 states. [2019-09-08 12:34:22,543 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-08 12:34:23,294 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 12:34:23,457 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-08 12:34:23,697 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:34:23,997 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 12:34:24,303 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:34:24,618 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-08 12:34:25,112 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-09-08 12:34:25,396 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-09-08 12:34:25,705 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2019-09-08 12:34:26,044 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 73 [2019-09-08 12:34:26,433 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-09-08 12:34:26,896 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 95 [2019-09-08 12:34:27,218 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-08 12:34:27,525 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-08 12:34:27,820 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 76 [2019-09-08 12:34:28,153 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2019-09-08 12:34:28,398 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-08 12:34:28,692 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2019-09-08 12:34:29,137 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 12:34:31,099 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-08 12:34:31,644 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:34:32,878 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-08 12:34:33,588 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 12:34:33,813 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-08 12:34:34,130 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-08 12:34:34,564 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-08 12:34:34,880 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-08 12:34:37,417 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-09-08 12:34:40,087 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-08 12:34:41,753 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-09-08 12:34:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:58,205 INFO L93 Difference]: Finished difference Result 2544 states and 3564 transitions. [2019-09-08 12:34:58,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 12:34:58,205 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 108 [2019-09-08 12:34:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:58,208 INFO L225 Difference]: With dead ends: 2544 [2019-09-08 12:34:58,208 INFO L226 Difference]: Without dead ends: 2538 [2019-09-08 12:34:58,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1054, Invalid=5426, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 12:34:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2019-09-08 12:34:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 240. [2019-09-08 12:34:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 12:34:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2019-09-08 12:34:58,359 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 108 [2019-09-08 12:34:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:58,360 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2019-09-08 12:34:58,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:34:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2019-09-08 12:34:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:34:58,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:58,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,361 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:58,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:58,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2007744804, now seen corresponding path program 1 times [2019-09-08 12:34:58,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:58,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:58,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:58,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:58,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:59,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:59,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:34:59,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:34:59,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:34:59,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:34:59,030 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand 17 states. [2019-09-08 12:35:00,210 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:35:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:02,241 INFO L93 Difference]: Finished difference Result 765 states and 1037 transitions. [2019-09-08 12:35:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:35:02,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2019-09-08 12:35:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:02,243 INFO L225 Difference]: With dead ends: 765 [2019-09-08 12:35:02,243 INFO L226 Difference]: Without dead ends: 759 [2019-09-08 12:35:02,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:35:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-08 12:35:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 234. [2019-09-08 12:35:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-08 12:35:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2019-09-08 12:35:02,390 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 109 [2019-09-08 12:35:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:02,390 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2019-09-08 12:35:02,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:35:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2019-09-08 12:35:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:35:02,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:02,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,392 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1423793173, now seen corresponding path program 1 times [2019-09-08 12:35:02,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:02,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:02,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:02,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:35:02,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:02,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:35:02,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:35:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:35:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:35:02,832 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand 13 states. [2019-09-08 12:35:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:04,696 INFO L93 Difference]: Finished difference Result 642 states and 869 transitions. [2019-09-08 12:35:04,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:35:04,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2019-09-08 12:35:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:04,698 INFO L225 Difference]: With dead ends: 642 [2019-09-08 12:35:04,698 INFO L226 Difference]: Without dead ends: 636 [2019-09-08 12:35:04,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:35:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-08 12:35:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 189. [2019-09-08 12:35:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-08 12:35:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 231 transitions. [2019-09-08 12:35:04,826 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 231 transitions. Word has length 109 [2019-09-08 12:35:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:04,826 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 231 transitions. [2019-09-08 12:35:04,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:35:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 231 transitions. [2019-09-08 12:35:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:35:04,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:04,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,827 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1928476296, now seen corresponding path program 1 times [2019-09-08 12:35:04,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:04,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:04,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:04,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:04,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:04,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:04,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:35:04,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:35:04,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:35:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:35:04,898 INFO L87 Difference]: Start difference. First operand 189 states and 231 transitions. Second operand 3 states. [2019-09-08 12:35:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:05,145 INFO L93 Difference]: Finished difference Result 335 states and 443 transitions. [2019-09-08 12:35:05,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:35:05,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 12:35:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:05,146 INFO L225 Difference]: With dead ends: 335 [2019-09-08 12:35:05,146 INFO L226 Difference]: Without dead ends: 260 [2019-09-08 12:35:05,146 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:35:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-08 12:35:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-09-08 12:35:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 12:35:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 331 transitions. [2019-09-08 12:35:05,360 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 331 transitions. Word has length 139 [2019-09-08 12:35:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:05,360 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 331 transitions. [2019-09-08 12:35:05,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:35:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 331 transitions. [2019-09-08 12:35:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:35:05,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:05,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,361 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash -458142361, now seen corresponding path program 1 times [2019-09-08 12:35:05,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:05,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:05,461 INFO L134 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:05,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:05,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:35:05,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:35:05,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:35:05,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:35:05,462 INFO L87 Difference]: Start difference. First operand 258 states and 331 transitions. Second operand 7 states. [2019-09-08 12:35:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:07,015 INFO L93 Difference]: Finished difference Result 1010 states and 1427 transitions. [2019-09-08 12:35:07,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:35:07,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:35:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:07,016 INFO L225 Difference]: With dead ends: 1010 [2019-09-08 12:35:07,016 INFO L226 Difference]: Without dead ends: 866 [2019-09-08 12:35:07,017 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:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-09-08 12:35:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 420. [2019-09-08 12:35:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-08 12:35:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 568 transitions. [2019-09-08 12:35:07,442 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 568 transitions. Word has length 141 [2019-09-08 12:35:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:07,443 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 568 transitions. [2019-09-08 12:35:07,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:35:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 568 transitions. [2019-09-08 12:35:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:35:07,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:07,443 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,444 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:07,444 INFO L82 PathProgramCache]: Analyzing trace with hash 569314779, now seen corresponding path program 1 times [2019-09-08 12:35:07,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:07,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:07,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:07,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:07,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:07,543 INFO L134 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:07,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:07,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:35:07,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:35:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:35:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:35:07,544 INFO L87 Difference]: Start difference. First operand 420 states and 568 transitions. Second operand 7 states. [2019-09-08 12:35:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:09,927 INFO L93 Difference]: Finished difference Result 1836 states and 2628 transitions. [2019-09-08 12:35:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:35:09,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:35:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:09,929 INFO L225 Difference]: With dead ends: 1836 [2019-09-08 12:35:09,929 INFO L226 Difference]: Without dead ends: 1530 [2019-09-08 12:35:09,929 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:35:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2019-09-08 12:35:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 764. [2019-09-08 12:35:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-09-08 12:35:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1070 transitions. [2019-09-08 12:35:10,776 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1070 transitions. Word has length 141 [2019-09-08 12:35:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:10,776 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 1070 transitions. [2019-09-08 12:35:10,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:35:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1070 transitions. [2019-09-08 12:35:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:35:10,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:10,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,777 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1954899243, now seen corresponding path program 1 times [2019-09-08 12:35:10,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:10,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:10,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:10,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:10,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:10,878 INFO L134 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:10,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:10,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:35:10,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:35:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:35:10,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:35:10,879 INFO L87 Difference]: Start difference. First operand 764 states and 1070 transitions. Second operand 7 states. [2019-09-08 12:35:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:15,014 INFO L93 Difference]: Finished difference Result 3588 states and 5170 transitions. [2019-09-08 12:35:15,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:35:15,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:35:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:15,017 INFO L225 Difference]: With dead ends: 3588 [2019-09-08 12:35:15,017 INFO L226 Difference]: Without dead ends: 2938 [2019-09-08 12:35:15,019 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:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2019-09-08 12:35:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1492. [2019-09-08 12:35:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2019-09-08 12:35:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2130 transitions. [2019-09-08 12:35:16,769 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2130 transitions. Word has length 141 [2019-09-08 12:35:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:16,769 INFO L475 AbstractCegarLoop]: Abstraction has 1492 states and 2130 transitions. [2019-09-08 12:35:16,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:35:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2130 transitions. [2019-09-08 12:35:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:35:16,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:16,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,770 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1726425210, now seen corresponding path program 1 times [2019-09-08 12:35:16,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:16,839 INFO L134 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:16,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:35:16,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:35:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:35:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:35:16,840 INFO L87 Difference]: Start difference. First operand 1492 states and 2130 transitions. Second operand 3 states. [2019-09-08 12:35:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:19,453 INFO L93 Difference]: Finished difference Result 3576 states and 5172 transitions. [2019-09-08 12:35:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:35:19,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 12:35:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:19,455 INFO L225 Difference]: With dead ends: 3576 [2019-09-08 12:35:19,455 INFO L226 Difference]: Without dead ends: 2198 [2019-09-08 12:35:19,456 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:35:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-09-08 12:35:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2196. [2019-09-08 12:35:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-09-08 12:35:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3146 transitions. [2019-09-08 12:35:22,073 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3146 transitions. Word has length 141 [2019-09-08 12:35:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:22,073 INFO L475 AbstractCegarLoop]: Abstraction has 2196 states and 3146 transitions. [2019-09-08 12:35:22,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:35:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3146 transitions. [2019-09-08 12:35:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:35:22,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,074 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:22,074 INFO L82 PathProgramCache]: Analyzing trace with hash 986684889, now seen corresponding path program 1 times [2019-09-08 12:35:22,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:22,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:22,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:22,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:35:22,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:22,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:35:22,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:35:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:35:22,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:35:22,134 INFO L87 Difference]: Start difference. First operand 2196 states and 3146 transitions. Second operand 3 states. [2019-09-08 12:35:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:26,129 INFO L93 Difference]: Finished difference Result 5324 states and 7660 transitions. [2019-09-08 12:35:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:35:26,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 12:35:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:26,132 INFO L225 Difference]: With dead ends: 5324 [2019-09-08 12:35:26,133 INFO L226 Difference]: Without dead ends: 3242 [2019-09-08 12:35:26,134 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:35:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2019-09-08 12:35:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3240. [2019-09-08 12:35:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3240 states. [2019-09-08 12:35:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4610 transitions. [2019-09-08 12:35:30,226 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4610 transitions. Word has length 141 [2019-09-08 12:35:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:30,227 INFO L475 AbstractCegarLoop]: Abstraction has 3240 states and 4610 transitions. [2019-09-08 12:35:30,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:35:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4610 transitions. [2019-09-08 12:35:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:35:30,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:30,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,228 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash 358346831, now seen corresponding path program 1 times [2019-09-08 12:35:30,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:30,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:30,327 INFO L134 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:30,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:30,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:35:30,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:35:30,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:35:30,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:35:30,328 INFO L87 Difference]: Start difference. First operand 3240 states and 4610 transitions. Second operand 7 states. [2019-09-08 12:35:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:47,757 INFO L93 Difference]: Finished difference Result 16032 states and 22854 transitions. [2019-09-08 12:35:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:35:47,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:35:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:47,768 INFO L225 Difference]: With dead ends: 16032 [2019-09-08 12:35:47,768 INFO L226 Difference]: Without dead ends: 12906 [2019-09-08 12:35:47,772 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:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2019-09-08 12:35:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 6724. [2019-09-08 12:35:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6724 states. [2019-09-08 12:35:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6724 states to 6724 states and 9602 transitions. [2019-09-08 12:35:56,156 INFO L78 Accepts]: Start accepts. Automaton has 6724 states and 9602 transitions. Word has length 141 [2019-09-08 12:35:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:56,156 INFO L475 AbstractCegarLoop]: Abstraction has 6724 states and 9602 transitions. [2019-09-08 12:35:56,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:35:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6724 states and 9602 transitions. [2019-09-08 12:35:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:35:56,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:56,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,158 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1091090079, now seen corresponding path program 1 times [2019-09-08 12:35:56,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:56,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:56,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:56,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:56,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:56,259 INFO L134 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:56,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:56,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:35:56,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:35:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:35:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:35:56,260 INFO L87 Difference]: Start difference. First operand 6724 states and 9602 transitions. Second operand 7 states. [2019-09-08 12:36:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:27,088 INFO L93 Difference]: Finished difference Result 30804 states and 44166 transitions. [2019-09-08 12:36:27,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:36:27,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:36:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:27,112 INFO L225 Difference]: With dead ends: 30804 [2019-09-08 12:36:27,112 INFO L226 Difference]: Without dead ends: 24194 [2019-09-08 12:36:27,120 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:36:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24194 states. [2019-09-08 12:36:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24194 to 14052. [2019-09-08 12:36:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14052 states. [2019-09-08 12:36:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14052 states to 14052 states and 20090 transitions. [2019-09-08 12:36:44,670 INFO L78 Accepts]: Start accepts. Automaton has 14052 states and 20090 transitions. Word has length 141 [2019-09-08 12:36:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:44,670 INFO L475 AbstractCegarLoop]: Abstraction has 14052 states and 20090 transitions. [2019-09-08 12:36:44,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:36:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14052 states and 20090 transitions. [2019-09-08 12:36:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:36:44,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:44,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,672 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1360730605, now seen corresponding path program 1 times [2019-09-08 12:36:44,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:44,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:44,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:44,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:44,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:44,766 INFO L134 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:44,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:44,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:36:44,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:36:44,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:36:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:36:44,767 INFO L87 Difference]: Start difference. First operand 14052 states and 20090 transitions. Second operand 7 states. [2019-09-08 12:37:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:24,243 INFO L93 Difference]: Finished difference Result 43948 states and 62398 transitions. [2019-09-08 12:37:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:37:24,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 12:37:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:24,270 INFO L225 Difference]: With dead ends: 43948 [2019-09-08 12:37:24,270 INFO L226 Difference]: Without dead ends: 30010 [2019-09-08 12:37:24,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:37:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30010 states. [2019-09-08 12:37:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30010 to 16468. [2019-09-08 12:37:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16468 states. [2019-09-08 12:37:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16468 states to 16468 states and 23162 transitions. [2019-09-08 12:37:46,315 INFO L78 Accepts]: Start accepts. Automaton has 16468 states and 23162 transitions. Word has length 141 [2019-09-08 12:37:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:46,316 INFO L475 AbstractCegarLoop]: Abstraction has 16468 states and 23162 transitions. [2019-09-08 12:37:46,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:37:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 16468 states and 23162 transitions. [2019-09-08 12:37:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:37:46,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:46,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,318 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:46,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1920406526, now seen corresponding path program 1 times [2019-09-08 12:37:46,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:46,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:46,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:46,408 INFO L134 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:46,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:46,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:37:46,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:37:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:37:46,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:37:46,409 INFO L87 Difference]: Start difference. First operand 16468 states and 23162 transitions. Second operand 6 states. [2019-09-08 12:38:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:23,239 INFO L93 Difference]: Finished difference Result 27321 states and 38053 transitions. [2019-09-08 12:38:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:38:23,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 12:38:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:23,327 INFO L225 Difference]: With dead ends: 27321 [2019-09-08 12:38:23,327 INFO L226 Difference]: Without dead ends: 27319 [2019-09-08 12:38:23,332 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:38:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27319 states. [2019-09-08 12:38:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27319 to 16660. [2019-09-08 12:38:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16660 states. [2019-09-08 12:38:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16660 states to 16660 states and 23290 transitions. [2019-09-08 12:38:45,076 INFO L78 Accepts]: Start accepts. Automaton has 16660 states and 23290 transitions. Word has length 142 [2019-09-08 12:38:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:45,076 INFO L475 AbstractCegarLoop]: Abstraction has 16660 states and 23290 transitions. [2019-09-08 12:38:45,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:38:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 16660 states and 23290 transitions. [2019-09-08 12:38:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:38:45,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:45,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,078 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash 938906370, now seen corresponding path program 1 times [2019-09-08 12:38:45,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:45,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:45,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:45,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:45,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:45,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:45,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:38:45,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:38:45,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:38:45,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:38:45,140 INFO L87 Difference]: Start difference. First operand 16660 states and 23290 transitions. Second operand 3 states. [2019-09-08 12:39:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:20,105 INFO L93 Difference]: Finished difference Result 43720 states and 61580 transitions. [2019-09-08 12:39:20,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:39:20,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 12:39:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:20,131 INFO L225 Difference]: With dead ends: 43720 [2019-09-08 12:39:20,131 INFO L226 Difference]: Without dead ends: 27174 [2019-09-08 12:39:20,144 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:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27174 states. [2019-09-08 12:39:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27174 to 19868. [2019-09-08 12:39:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2019-09-08 12:39:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 27986 transitions. [2019-09-08 12:39:46,080 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 27986 transitions. Word has length 142 [2019-09-08 12:39:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:46,080 INFO L475 AbstractCegarLoop]: Abstraction has 19868 states and 27986 transitions. [2019-09-08 12:39:46,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:39:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 27986 transitions. [2019-09-08 12:39:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 12:39:46,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,082 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash 824570804, now seen corresponding path program 1 times [2019-09-08 12:39:46,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:46,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:46,153 INFO L134 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:46,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:46,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:39:46,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:39:46,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:39:46,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:46,154 INFO L87 Difference]: Start difference. First operand 19868 states and 27986 transitions. Second operand 3 states. [2019-09-08 12:40:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:11,962 INFO L93 Difference]: Finished difference Result 38364 states and 53956 transitions. [2019-09-08 12:40:11,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:40:11,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-08 12:40:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:11,980 INFO L225 Difference]: With dead ends: 38364 [2019-09-08 12:40:11,980 INFO L226 Difference]: Without dead ends: 18610 [2019-09-08 12:40:11,994 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:40:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18610 states. [2019-09-08 12:40:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18610 to 15308. [2019-09-08 12:40:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15308 states. [2019-09-08 12:40:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15308 states to 15308 states and 21314 transitions. [2019-09-08 12:40:32,596 INFO L78 Accepts]: Start accepts. Automaton has 15308 states and 21314 transitions. Word has length 143 [2019-09-08 12:40:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:32,596 INFO L475 AbstractCegarLoop]: Abstraction has 15308 states and 21314 transitions. [2019-09-08 12:40:32,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:40:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 15308 states and 21314 transitions. [2019-09-08 12:40:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:40:32,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:32,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,597 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:32,597 INFO L82 PathProgramCache]: Analyzing trace with hash 883260062, now seen corresponding path program 1 times [2019-09-08 12:40:32,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:32,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:32,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:32,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:32,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:32,659 INFO L134 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:40:32,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:32,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:40:32,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:40:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:40:32,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:40:32,660 INFO L87 Difference]: Start difference. First operand 15308 states and 21314 transitions. Second operand 3 states.