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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:22:29,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:22:29,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:22:29,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:22:29,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:22:29,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:22:29,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:22:29,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:22:29,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:22:29,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:22:29,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:22:29,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:22:29,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:22:29,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:22:29,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:22:29,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:22:29,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:22:29,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:22:29,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:22:29,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:22:29,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:22:29,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:22:29,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:22:29,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:22:29,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:22:29,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:22:29,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:22:29,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:22:29,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:22:29,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:22:29,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:22:29,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:22:29,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:22:29,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:22:29,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:22:29,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:22:29,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:22:29,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:22:29,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:22:29,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:22:29,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:22:29,660 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:22:29,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:22:29,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:22:29,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:22:29,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:22:29,685 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:22:29,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:22:29,685 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:22:29,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:22:29,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:22:29,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:22:29,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:22:29,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:22:29,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:22:29,687 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:22:29,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:22:29,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:22:29,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:22:29,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:22:29,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:22:29,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:22:29,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:22:29,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:22:29,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:22:29,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:22:29,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:22:29,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:22:29,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:22:29,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:22:29,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:22:29,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:22:29,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:22:29,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:22:29,777 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:22:29,778 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:22:29,779 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:22:29,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8def584d/f44d02b0b22e4a3eab9db07f560157cb/FLAG2cb0b8bd8 [2019-09-08 12:22:30,595 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:22:30,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:22:30,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8def584d/f44d02b0b22e4a3eab9db07f560157cb/FLAG2cb0b8bd8 [2019-09-08 12:22:30,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8def584d/f44d02b0b22e4a3eab9db07f560157cb [2019-09-08 12:22:30,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:22:30,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:22:30,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:22:30,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:22:30,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:22:30,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:22:30" (1/1) ... [2019-09-08 12:22:30,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afe9dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:30, skipping insertion in model container [2019-09-08 12:22:30,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:22:30" (1/1) ... [2019-09-08 12:22:30,733 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:22:30,955 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:22:32,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:22:32,291 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:22:32,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:22:32,985 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:22:32,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32 WrapperNode [2019-09-08 12:22:32,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:22:32,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:22:32,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:22:32,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:22:33,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (1/1) ... [2019-09-08 12:22:33,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (1/1) ... [2019-09-08 12:22:33,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (1/1) ... [2019-09-08 12:22:33,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (1/1) ... [2019-09-08 12:22:33,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (1/1) ... [2019-09-08 12:22:33,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (1/1) ... [2019-09-08 12:22:33,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (1/1) ... [2019-09-08 12:22:33,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:22:33,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:22:33,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:22:33,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:22:33,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (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:22:33,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:22:33,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:22:33,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:22:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:22:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:22:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:22:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:22:33,311 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:22:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:22:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:22:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:22:33,312 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:22:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:22:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:22:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:22:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:22:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:22:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:22:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:22:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:22:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:22:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:22:36,896 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:22:36,896 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:22:36,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:22:36 BoogieIcfgContainer [2019-09-08 12:22:36,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:22:36,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:22:36,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:22:36,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:22:36,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:22:30" (1/3) ... [2019-09-08 12:22:36,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f007d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:22:36, skipping insertion in model container [2019-09-08 12:22:36,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:22:32" (2/3) ... [2019-09-08 12:22:36,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f007d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:22:36, skipping insertion in model container [2019-09-08 12:22:36,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:22:36" (3/3) ... [2019-09-08 12:22:36,908 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:22:36,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:22:36,941 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-08 12:22:36,967 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-08 12:22:37,015 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:22:37,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:22:37,016 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:22:37,016 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:22:37,016 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:22:37,016 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:22:37,017 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:22:37,017 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:22:37,017 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:22:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states. [2019-09-08 12:22:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:22:37,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:37,106 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:37,108 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash -583578649, now seen corresponding path program 1 times [2019-09-08 12:22:37,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:37,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:37,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:37,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:37,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:37,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:22:37,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:22:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:22:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:22:37,885 INFO L87 Difference]: Start difference. First operand 1129 states. Second operand 5 states. [2019-09-08 12:22:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:39,149 INFO L93 Difference]: Finished difference Result 2056 states and 3574 transitions. [2019-09-08 12:22:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:22:39,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-08 12:22:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:39,183 INFO L225 Difference]: With dead ends: 2056 [2019-09-08 12:22:39,184 INFO L226 Difference]: Without dead ends: 1218 [2019-09-08 12:22:39,196 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:22:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-09-08 12:22:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1138. [2019-09-08 12:22:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-08 12:22:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1527 transitions. [2019-09-08 12:22:39,352 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1527 transitions. Word has length 89 [2019-09-08 12:22:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:39,353 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1527 transitions. [2019-09-08 12:22:39,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:22:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1527 transitions. [2019-09-08 12:22:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:22:39,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:39,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] [2019-09-08 12:22:39,362 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:39,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2090250761, now seen corresponding path program 1 times [2019-09-08 12:22:39,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:39,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:39,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:39,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:22:39,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:39,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:22:39,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:22:39,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:22:39,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:22:39,677 INFO L87 Difference]: Start difference. First operand 1138 states and 1527 transitions. Second operand 5 states. [2019-09-08 12:22:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:40,342 INFO L93 Difference]: Finished difference Result 1973 states and 2720 transitions. [2019-09-08 12:22:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:22:40,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:22:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:40,349 INFO L225 Difference]: With dead ends: 1973 [2019-09-08 12:22:40,349 INFO L226 Difference]: Without dead ends: 1013 [2019-09-08 12:22:40,352 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:22:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-09-08 12:22:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1013. [2019-09-08 12:22:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-09-08 12:22:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1384 transitions. [2019-09-08 12:22:40,395 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1384 transitions. Word has length 90 [2019-09-08 12:22:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:40,396 INFO L475 AbstractCegarLoop]: Abstraction has 1013 states and 1384 transitions. [2019-09-08 12:22:40,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:22:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1384 transitions. [2019-09-08 12:22:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:22:40,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:40,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:40,400 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash -592131867, now seen corresponding path program 1 times [2019-09-08 12:22:40,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:40,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:40,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:40,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:40,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:22:40,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:22:40,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:22:40,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:22:40,620 INFO L87 Difference]: Start difference. First operand 1013 states and 1384 transitions. Second operand 5 states. [2019-09-08 12:22:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:41,300 INFO L93 Difference]: Finished difference Result 1848 states and 2575 transitions. [2019-09-08 12:22:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:22:41,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:22:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:41,308 INFO L225 Difference]: With dead ends: 1848 [2019-09-08 12:22:41,309 INFO L226 Difference]: Without dead ends: 955 [2019-09-08 12:22:41,313 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:22:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-08 12:22:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2019-09-08 12:22:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-09-08 12:22:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1316 transitions. [2019-09-08 12:22:41,424 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1316 transitions. Word has length 91 [2019-09-08 12:22:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:41,425 INFO L475 AbstractCegarLoop]: Abstraction has 955 states and 1316 transitions. [2019-09-08 12:22:41,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:22:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1316 transitions. [2019-09-08 12:22:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:22:41,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:41,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] [2019-09-08 12:22:41,430 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash -21106018, now seen corresponding path program 1 times [2019-09-08 12:22:41,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:41,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:41,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:41,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:41,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:41,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:41,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:22:41,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:22:41,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:22:41,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:22:41,606 INFO L87 Difference]: Start difference. First operand 955 states and 1316 transitions. Second operand 5 states. [2019-09-08 12:22:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:42,329 INFO L93 Difference]: Finished difference Result 1790 states and 2505 transitions. [2019-09-08 12:22:42,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:22:42,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 12:22:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:42,335 INFO L225 Difference]: With dead ends: 1790 [2019-09-08 12:22:42,336 INFO L226 Difference]: Without dead ends: 929 [2019-09-08 12:22:42,338 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:22:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-08 12:22:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2019-09-08 12:22:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-08 12:22:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1284 transitions. [2019-09-08 12:22:42,386 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1284 transitions. Word has length 92 [2019-09-08 12:22:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:42,387 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1284 transitions. [2019-09-08 12:22:42,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:22:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1284 transitions. [2019-09-08 12:22:42,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:22:42,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:42,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:42,391 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1839633213, now seen corresponding path program 1 times [2019-09-08 12:22:42,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:42,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:42,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:42,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:42,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:22:42,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:22:42,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:22:42,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:22:42,527 INFO L87 Difference]: Start difference. First operand 929 states and 1284 transitions. Second operand 5 states. [2019-09-08 12:22:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:43,107 INFO L93 Difference]: Finished difference Result 1764 states and 2471 transitions. [2019-09-08 12:22:43,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:22:43,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:22:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:43,114 INFO L225 Difference]: With dead ends: 1764 [2019-09-08 12:22:43,114 INFO L226 Difference]: Without dead ends: 910 [2019-09-08 12:22:43,116 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:22:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-09-08 12:22:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2019-09-08 12:22:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-08 12:22:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1261 transitions. [2019-09-08 12:22:43,163 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1261 transitions. Word has length 93 [2019-09-08 12:22:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:43,163 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1261 transitions. [2019-09-08 12:22:43,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:22:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1261 transitions. [2019-09-08 12:22:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:22:43,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:43,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:43,167 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:43,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1412961549, now seen corresponding path program 1 times [2019-09-08 12:22:43,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:43,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:43,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:43,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:43,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:22:43,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:22:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:22:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:22:43,298 INFO L87 Difference]: Start difference. First operand 910 states and 1261 transitions. Second operand 5 states. [2019-09-08 12:22:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:43,980 INFO L93 Difference]: Finished difference Result 1745 states and 2446 transitions. [2019-09-08 12:22:43,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:22:43,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-08 12:22:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:43,986 INFO L225 Difference]: With dead ends: 1745 [2019-09-08 12:22:43,986 INFO L226 Difference]: Without dead ends: 905 [2019-09-08 12:22:43,988 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:22:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-08 12:22:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2019-09-08 12:22:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:22:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1253 transitions. [2019-09-08 12:22:44,032 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1253 transitions. Word has length 94 [2019-09-08 12:22:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:44,032 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1253 transitions. [2019-09-08 12:22:44,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:22:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1253 transitions. [2019-09-08 12:22:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:22:44,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:44,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:44,036 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:44,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1447378303, now seen corresponding path program 1 times [2019-09-08 12:22:44,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:44,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:44,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:44,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:44,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:44,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:44,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:22:44,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:22:44,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:22:44,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:22:44,289 INFO L87 Difference]: Start difference. First operand 905 states and 1253 transitions. Second operand 9 states. [2019-09-08 12:22:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:46,134 INFO L93 Difference]: Finished difference Result 1869 states and 2638 transitions. [2019-09-08 12:22:46,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:22:46,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-08 12:22:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:46,143 INFO L225 Difference]: With dead ends: 1869 [2019-09-08 12:22:46,143 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:22:46,145 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:22:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:22:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-08 12:22:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:22:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1252 transitions. [2019-09-08 12:22:46,205 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1252 transitions. Word has length 95 [2019-09-08 12:22:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:46,206 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1252 transitions. [2019-09-08 12:22:46,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:22:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1252 transitions. [2019-09-08 12:22:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:22:46,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:46,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:46,210 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:46,210 INFO L82 PathProgramCache]: Analyzing trace with hash -102853389, now seen corresponding path program 1 times [2019-09-08 12:22:46,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:46,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:46,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:46,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:46,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:22:46,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:22:46,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:22:46,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:22:46,409 INFO L87 Difference]: Start difference. First operand 905 states and 1252 transitions. Second operand 9 states. [2019-09-08 12:22:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:48,947 INFO L93 Difference]: Finished difference Result 1892 states and 2661 transitions. [2019-09-08 12:22:48,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:22:48,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-08 12:22:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:48,957 INFO L225 Difference]: With dead ends: 1892 [2019-09-08 12:22:48,958 INFO L226 Difference]: Without dead ends: 1628 [2019-09-08 12:22:48,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:22:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-09-08 12:22:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 905. [2019-09-08 12:22:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:22:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1251 transitions. [2019-09-08 12:22:49,024 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1251 transitions. Word has length 95 [2019-09-08 12:22:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:49,024 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1251 transitions. [2019-09-08 12:22:49,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:22:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1251 transitions. [2019-09-08 12:22:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:22:49,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:49,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:49,028 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:49,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1602183325, now seen corresponding path program 1 times [2019-09-08 12:22:49,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:49,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:49,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:49,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:22:49,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:49,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:22:49,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:22:49,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:22:49,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:22:49,213 INFO L87 Difference]: Start difference. First operand 905 states and 1251 transitions. Second operand 8 states. [2019-09-08 12:22:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:50,753 INFO L93 Difference]: Finished difference Result 1643 states and 2215 transitions. [2019-09-08 12:22:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:22:50,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-09-08 12:22:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:50,764 INFO L225 Difference]: With dead ends: 1643 [2019-09-08 12:22:50,765 INFO L226 Difference]: Without dead ends: 1226 [2019-09-08 12:22:50,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:22:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2019-09-08 12:22:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 905. [2019-09-08 12:22:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:22:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1250 transitions. [2019-09-08 12:22:50,825 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1250 transitions. Word has length 95 [2019-09-08 12:22:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:50,826 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1250 transitions. [2019-09-08 12:22:50,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:22:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1250 transitions. [2019-09-08 12:22:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:22:50,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:50,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:50,830 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:50,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:50,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1113047675, now seen corresponding path program 1 times [2019-09-08 12:22:50,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:50,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:50,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:51,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:51,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:22:51,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:22:51,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:22:51,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:22:51,058 INFO L87 Difference]: Start difference. First operand 905 states and 1250 transitions. Second operand 9 states. [2019-09-08 12:22:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:53,015 INFO L93 Difference]: Finished difference Result 1838 states and 2583 transitions. [2019-09-08 12:22:53,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:22:53,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:22:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:53,026 INFO L225 Difference]: With dead ends: 1838 [2019-09-08 12:22:53,027 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:22:53,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:22:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:22:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:22:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:22:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1248 transitions. [2019-09-08 12:22:53,103 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1248 transitions. Word has length 97 [2019-09-08 12:22:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:53,104 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1248 transitions. [2019-09-08 12:22:53,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:22:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1248 transitions. [2019-09-08 12:22:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:22:53,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:53,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:53,107 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:53,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1446852495, now seen corresponding path program 1 times [2019-09-08 12:22:53,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:53,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:53,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:53,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:53,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:22:53,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:22:53,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:22:53,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:22:53,364 INFO L87 Difference]: Start difference. First operand 905 states and 1248 transitions. Second operand 9 states. [2019-09-08 12:22:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:55,204 INFO L93 Difference]: Finished difference Result 1888 states and 2653 transitions. [2019-09-08 12:22:55,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:22:55,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:22:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:55,213 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:22:55,213 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:22:55,214 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:22:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:22:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-08 12:22:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:22:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1246 transitions. [2019-09-08 12:22:55,300 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1246 transitions. Word has length 97 [2019-09-08 12:22:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:55,301 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1246 transitions. [2019-09-08 12:22:55,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:22:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1246 transitions. [2019-09-08 12:22:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:22:55,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:55,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:55,306 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash 794751107, now seen corresponding path program 1 times [2019-09-08 12:22:55,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:55,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:55,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:55,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:55,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:55,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:22:55,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:55,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:22:55,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:22:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:22:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:22:55,580 INFO L87 Difference]: Start difference. First operand 905 states and 1246 transitions. Second operand 9 states. [2019-09-08 12:22:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:57,558 INFO L93 Difference]: Finished difference Result 1838 states and 2579 transitions. [2019-09-08 12:22:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:22:57,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:22:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:57,567 INFO L225 Difference]: With dead ends: 1838 [2019-09-08 12:22:57,567 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:22:57,569 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:22:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:22:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:22:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:22:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1244 transitions. [2019-09-08 12:22:57,641 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1244 transitions. Word has length 97 [2019-09-08 12:22:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:57,642 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1244 transitions. [2019-09-08 12:22:57,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:22:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1244 transitions. [2019-09-08 12:22:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:22:57,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:57,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:57,645 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:57,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1280890073, now seen corresponding path program 1 times [2019-09-08 12:22:57,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:57,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:57,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:57,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:57,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:57,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:57,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:22:57,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:22:57,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:22:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:22:57,836 INFO L87 Difference]: Start difference. First operand 905 states and 1244 transitions. Second operand 9 states. [2019-09-08 12:22:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:59,890 INFO L93 Difference]: Finished difference Result 1682 states and 2371 transitions. [2019-09-08 12:22:59,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:22:59,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:22:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:59,897 INFO L225 Difference]: With dead ends: 1682 [2019-09-08 12:22:59,897 INFO L226 Difference]: Without dead ends: 1282 [2019-09-08 12:22:59,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:22:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-09-08 12:22:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 905. [2019-09-08 12:22:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:22:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1242 transitions. [2019-09-08 12:22:59,969 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1242 transitions. Word has length 97 [2019-09-08 12:22:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:59,969 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1242 transitions. [2019-09-08 12:22:59,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:22:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1242 transitions. [2019-09-08 12:22:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:22:59,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:59,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:59,973 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1541936904, now seen corresponding path program 1 times [2019-09-08 12:22:59,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:59,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:59,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:00,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:00,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:00,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:00,153 INFO L87 Difference]: Start difference. First operand 905 states and 1242 transitions. Second operand 9 states. [2019-09-08 12:23:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:02,308 INFO L93 Difference]: Finished difference Result 1828 states and 2561 transitions. [2019-09-08 12:23:02,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:02,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:23:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:02,314 INFO L225 Difference]: With dead ends: 1828 [2019-09-08 12:23:02,314 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:02,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1241 transitions. [2019-09-08 12:23:02,388 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1241 transitions. Word has length 97 [2019-09-08 12:23:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:02,388 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1241 transitions. [2019-09-08 12:23:02,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1241 transitions. [2019-09-08 12:23:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:23:02,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23: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] [2019-09-08 12:23:02,392 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -824530987, now seen corresponding path program 1 times [2019-09-08 12:23:02,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:02,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:02,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:02,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:02,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:02,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:02,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:02,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:02,584 INFO L87 Difference]: Start difference. First operand 905 states and 1241 transitions. Second operand 9 states. [2019-09-08 12:23:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:04,551 INFO L93 Difference]: Finished difference Result 1832 states and 2563 transitions. [2019-09-08 12:23:04,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:04,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:23:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:04,557 INFO L225 Difference]: With dead ends: 1832 [2019-09-08 12:23:04,557 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:04,558 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:23:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1240 transitions. [2019-09-08 12:23:04,635 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1240 transitions. Word has length 97 [2019-09-08 12:23:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:04,636 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1240 transitions. [2019-09-08 12:23:04,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1240 transitions. [2019-09-08 12:23:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:23:04,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:04,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:04,639 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash 990068976, now seen corresponding path program 1 times [2019-09-08 12:23:04,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:04,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:04,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:04,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:04,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:04,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:04,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:04,847 INFO L87 Difference]: Start difference. First operand 905 states and 1240 transitions. Second operand 9 states. [2019-09-08 12:23:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:06,742 INFO L93 Difference]: Finished difference Result 1828 states and 2558 transitions. [2019-09-08 12:23:06,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:06,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:23:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:06,748 INFO L225 Difference]: With dead ends: 1828 [2019-09-08 12:23:06,748 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:06,750 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:23:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1239 transitions. [2019-09-08 12:23:06,831 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1239 transitions. Word has length 97 [2019-09-08 12:23:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:06,832 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1239 transitions. [2019-09-08 12:23:06,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1239 transitions. [2019-09-08 12:23:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:23:06,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:06,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] [2019-09-08 12:23:06,835 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1326473449, now seen corresponding path program 1 times [2019-09-08 12:23:06,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:06,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:07,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:07,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:07,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:07,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:07,011 INFO L87 Difference]: Start difference. First operand 905 states and 1239 transitions. Second operand 9 states. [2019-09-08 12:23:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:09,243 INFO L93 Difference]: Finished difference Result 1869 states and 2618 transitions. [2019-09-08 12:23:09,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:09,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:23:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:09,249 INFO L225 Difference]: With dead ends: 1869 [2019-09-08 12:23:09,249 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:23:09,251 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:23:09,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:23:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-08 12:23:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1238 transitions. [2019-09-08 12:23:09,315 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1238 transitions. Word has length 97 [2019-09-08 12:23:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:09,315 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1238 transitions. [2019-09-08 12:23:09,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1238 transitions. [2019-09-08 12:23:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:23:09,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:09,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] [2019-09-08 12:23:09,318 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -975840379, now seen corresponding path program 1 times [2019-09-08 12:23:09,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:09,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:09,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:09,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:09,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:09,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:09,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:09,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:09,486 INFO L87 Difference]: Start difference. First operand 905 states and 1238 transitions. Second operand 9 states. [2019-09-08 12:23:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:11,469 INFO L93 Difference]: Finished difference Result 1878 states and 2625 transitions. [2019-09-08 12:23:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:11,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:23:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:11,477 INFO L225 Difference]: With dead ends: 1878 [2019-09-08 12:23:11,477 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:23:11,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:23:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-08 12:23:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1237 transitions. [2019-09-08 12:23:11,542 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1237 transitions. Word has length 97 [2019-09-08 12:23:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:11,542 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1237 transitions. [2019-09-08 12:23:11,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1237 transitions. [2019-09-08 12:23:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:23:11,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:11,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] [2019-09-08 12:23:11,546 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash -846389634, now seen corresponding path program 1 times [2019-09-08 12:23:11,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:11,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:11,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:11,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:11,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:11,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:11,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:11,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:11,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:11,720 INFO L87 Difference]: Start difference. First operand 905 states and 1237 transitions. Second operand 9 states. [2019-09-08 12:23:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:13,772 INFO L93 Difference]: Finished difference Result 1832 states and 2558 transitions. [2019-09-08 12:23:13,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:13,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:23:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:13,779 INFO L225 Difference]: With dead ends: 1832 [2019-09-08 12:23:13,779 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:13,780 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:23:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1236 transitions. [2019-09-08 12:23:13,852 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1236 transitions. Word has length 97 [2019-09-08 12:23:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:13,852 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1236 transitions. [2019-09-08 12:23:13,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1236 transitions. [2019-09-08 12:23:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:13,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:13,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:13,855 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:13,856 INFO L82 PathProgramCache]: Analyzing trace with hash -614722141, now seen corresponding path program 1 times [2019-09-08 12:23:13,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:13,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:13,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:14,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:14,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:14,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:14,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:14,025 INFO L87 Difference]: Start difference. First operand 905 states and 1236 transitions. Second operand 9 states. [2019-09-08 12:23:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:15,813 INFO L93 Difference]: Finished difference Result 1908 states and 2660 transitions. [2019-09-08 12:23:15,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:15,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:15,817 INFO L225 Difference]: With dead ends: 1908 [2019-09-08 12:23:15,817 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:23:15,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:23:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-08 12:23:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1234 transitions. [2019-09-08 12:23:15,901 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1234 transitions. Word has length 99 [2019-09-08 12:23:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:15,901 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1234 transitions. [2019-09-08 12:23:15,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1234 transitions. [2019-09-08 12:23:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:15,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:15,903 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:15,904 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1600456637, now seen corresponding path program 1 times [2019-09-08 12:23:15,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:15,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:16,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:16,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:16,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:16,067 INFO L87 Difference]: Start difference. First operand 905 states and 1234 transitions. Second operand 9 states. [2019-09-08 12:23:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:18,591 INFO L93 Difference]: Finished difference Result 2002 states and 2798 transitions. [2019-09-08 12:23:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:18,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:18,594 INFO L225 Difference]: With dead ends: 2002 [2019-09-08 12:23:18,594 INFO L226 Difference]: Without dead ends: 1726 [2019-09-08 12:23:18,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-08 12:23:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 905. [2019-09-08 12:23:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1232 transitions. [2019-09-08 12:23:18,672 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1232 transitions. Word has length 99 [2019-09-08 12:23:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:18,672 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1232 transitions. [2019-09-08 12:23:18,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1232 transitions. [2019-09-08 12:23:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:18,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:18,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:18,675 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash -16190442, now seen corresponding path program 1 times [2019-09-08 12:23:18,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:18,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:18,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:18,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:18,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:18,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:18,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:18,858 INFO L87 Difference]: Start difference. First operand 905 states and 1232 transitions. Second operand 9 states. [2019-09-08 12:23:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:20,748 INFO L93 Difference]: Finished difference Result 1844 states and 2568 transitions. [2019-09-08 12:23:20,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:20,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:20,753 INFO L225 Difference]: With dead ends: 1844 [2019-09-08 12:23:20,754 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:20,755 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:23:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1230 transitions. [2019-09-08 12:23:20,866 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1230 transitions. Word has length 99 [2019-09-08 12:23:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:20,866 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1230 transitions. [2019-09-08 12:23:20,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1230 transitions. [2019-09-08 12:23:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:20,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:20,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:20,869 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:20,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1945346954, now seen corresponding path program 1 times [2019-09-08 12:23:20,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:20,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:20,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:20,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:21,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:21,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:21,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:21,114 INFO L87 Difference]: Start difference. First operand 905 states and 1230 transitions. Second operand 9 states. [2019-09-08 12:23:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:23,304 INFO L93 Difference]: Finished difference Result 1780 states and 2465 transitions. [2019-09-08 12:23:23,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:23,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:23,308 INFO L225 Difference]: With dead ends: 1780 [2019-09-08 12:23:23,309 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:23:23,310 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:23:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:23:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:23:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1228 transitions. [2019-09-08 12:23:23,406 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1228 transitions. Word has length 99 [2019-09-08 12:23:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:23,406 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1228 transitions. [2019-09-08 12:23:23,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1228 transitions. [2019-09-08 12:23:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:23,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:23,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:23,408 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash 113260303, now seen corresponding path program 1 times [2019-09-08 12:23:23,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:23,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:23,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:23,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:23,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:23,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:23,584 INFO L87 Difference]: Start difference. First operand 905 states and 1228 transitions. Second operand 9 states. [2019-09-08 12:23:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:25,655 INFO L93 Difference]: Finished difference Result 1842 states and 2559 transitions. [2019-09-08 12:23:25,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:25,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:25,659 INFO L225 Difference]: With dead ends: 1842 [2019-09-08 12:23:25,660 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:25,661 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:23:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1226 transitions. [2019-09-08 12:23:25,773 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1226 transitions. Word has length 99 [2019-09-08 12:23:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:25,774 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1226 transitions. [2019-09-08 12:23:25,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1226 transitions. [2019-09-08 12:23:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:25,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:25,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:25,776 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash -503675873, now seen corresponding path program 1 times [2019-09-08 12:23:25,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:25,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:25,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:25,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:25,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:25,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:25,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:25,983 INFO L87 Difference]: Start difference. First operand 905 states and 1226 transitions. Second operand 9 states. [2019-09-08 12:23:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:28,381 INFO L93 Difference]: Finished difference Result 1970 states and 2741 transitions. [2019-09-08 12:23:28,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:28,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:28,386 INFO L225 Difference]: With dead ends: 1970 [2019-09-08 12:23:28,387 INFO L226 Difference]: Without dead ends: 1726 [2019-09-08 12:23:28,388 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:23:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-08 12:23:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 905. [2019-09-08 12:23:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1224 transitions. [2019-09-08 12:23:28,505 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1224 transitions. Word has length 99 [2019-09-08 12:23:28,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:28,505 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1224 transitions. [2019-09-08 12:23:28,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1224 transitions. [2019-09-08 12:23:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:28,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:28,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:28,508 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:28,508 INFO L82 PathProgramCache]: Analyzing trace with hash 412844447, now seen corresponding path program 1 times [2019-09-08 12:23:28,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:28,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:28,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:28,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:28,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:28,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:28,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:28,728 INFO L87 Difference]: Start difference. First operand 905 states and 1224 transitions. Second operand 9 states. [2019-09-08 12:23:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:30,763 INFO L93 Difference]: Finished difference Result 1776 states and 2454 transitions. [2019-09-08 12:23:30,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:30,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:30,768 INFO L225 Difference]: With dead ends: 1776 [2019-09-08 12:23:30,768 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:23:30,769 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:23:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:23:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:23:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1222 transitions. [2019-09-08 12:23:30,892 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1222 transitions. Word has length 99 [2019-09-08 12:23:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:30,892 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1222 transitions. [2019-09-08 12:23:30,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1222 transitions. [2019-09-08 12:23:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:30,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:30,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:30,894 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash -860630256, now seen corresponding path program 1 times [2019-09-08 12:23:30,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:30,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:30,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:31,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:31,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:31,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:31,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:31,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:31,066 INFO L87 Difference]: Start difference. First operand 905 states and 1222 transitions. Second operand 9 states. [2019-09-08 12:23:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:33,288 INFO L93 Difference]: Finished difference Result 1631 states and 2232 transitions. [2019-09-08 12:23:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:33,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:33,292 INFO L225 Difference]: With dead ends: 1631 [2019-09-08 12:23:33,292 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:23:33,293 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:23:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:23:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:23:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1220 transitions. [2019-09-08 12:23:33,406 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1220 transitions. Word has length 99 [2019-09-08 12:23:33,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:33,407 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1220 transitions. [2019-09-08 12:23:33,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1220 transitions. [2019-09-08 12:23:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:33,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:33,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:33,409 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:33,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash 155343894, now seen corresponding path program 1 times [2019-09-08 12:23:33,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:33,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:33,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:33,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:33,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:33,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:33,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:33,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:33,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:33,577 INFO L87 Difference]: Start difference. First operand 905 states and 1220 transitions. Second operand 9 states. [2019-09-08 12:23:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:35,697 INFO L93 Difference]: Finished difference Result 1776 states and 2448 transitions. [2019-09-08 12:23:35,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:35,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:35,700 INFO L225 Difference]: With dead ends: 1776 [2019-09-08 12:23:35,700 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:23:35,701 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:23:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:23:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:23:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1218 transitions. [2019-09-08 12:23:35,796 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1218 transitions. Word has length 99 [2019-09-08 12:23:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:35,796 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1218 transitions. [2019-09-08 12:23:35,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1218 transitions. [2019-09-08 12:23:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:35,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:35,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] [2019-09-08 12:23:35,799 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1278535753, now seen corresponding path program 1 times [2019-09-08 12:23:35,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:35,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:35,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:35,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:36,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:36,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:36,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:36,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:36,007 INFO L87 Difference]: Start difference. First operand 905 states and 1218 transitions. Second operand 9 states. [2019-09-08 12:23:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:38,507 INFO L93 Difference]: Finished difference Result 1921 states and 2670 transitions. [2019-09-08 12:23:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:38,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:38,510 INFO L225 Difference]: With dead ends: 1921 [2019-09-08 12:23:38,510 INFO L226 Difference]: Without dead ends: 1726 [2019-09-08 12:23:38,511 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:23:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-08 12:23:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 905. [2019-09-08 12:23:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1217 transitions. [2019-09-08 12:23:38,656 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1217 transitions. Word has length 99 [2019-09-08 12:23:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:38,657 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1217 transitions. [2019-09-08 12:23:38,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1217 transitions. [2019-09-08 12:23:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:38,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:38,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:38,659 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash -724838198, now seen corresponding path program 1 times [2019-09-08 12:23:38,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:38,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:38,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:38,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:38,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:38,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:38,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:38,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:38,827 INFO L87 Difference]: Start difference. First operand 905 states and 1217 transitions. Second operand 9 states. [2019-09-08 12:23:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:41,078 INFO L93 Difference]: Finished difference Result 1826 states and 2524 transitions. [2019-09-08 12:23:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:41,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:41,081 INFO L225 Difference]: With dead ends: 1826 [2019-09-08 12:23:41,081 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:41,082 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:23:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1216 transitions. [2019-09-08 12:23:41,160 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1216 transitions. Word has length 99 [2019-09-08 12:23:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:41,160 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1216 transitions. [2019-09-08 12:23:41,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1216 transitions. [2019-09-08 12:23:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:41,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:41,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:41,162 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -695001007, now seen corresponding path program 1 times [2019-09-08 12:23:41,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:41,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:41,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:41,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:41,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:41,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:41,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:41,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:41,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:41,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:41,352 INFO L87 Difference]: Start difference. First operand 905 states and 1216 transitions. Second operand 9 states. [2019-09-08 12:23:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:43,774 INFO L93 Difference]: Finished difference Result 1774 states and 2440 transitions. [2019-09-08 12:23:43,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:43,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:43,776 INFO L225 Difference]: With dead ends: 1774 [2019-09-08 12:23:43,776 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:23:43,778 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:23:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:23:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:23:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1215 transitions. [2019-09-08 12:23:43,913 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1215 transitions. Word has length 99 [2019-09-08 12:23:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:43,913 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1215 transitions. [2019-09-08 12:23:43,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1215 transitions. [2019-09-08 12:23:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:43,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23: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] [2019-09-08 12:23:43,916 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1931265789, now seen corresponding path program 1 times [2019-09-08 12:23:43,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:43,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:43,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:43,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:43,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:44,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:44,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:44,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:44,085 INFO L87 Difference]: Start difference. First operand 905 states and 1215 transitions. Second operand 9 states. [2019-09-08 12:23:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:46,555 INFO L93 Difference]: Finished difference Result 1863 states and 2582 transitions. [2019-09-08 12:23:46,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:46,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:46,558 INFO L225 Difference]: With dead ends: 1863 [2019-09-08 12:23:46,558 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:23:46,559 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:23:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:23:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-08 12:23:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1214 transitions. [2019-09-08 12:23:46,647 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1214 transitions. Word has length 99 [2019-09-08 12:23:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:46,647 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1214 transitions. [2019-09-08 12:23:46,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1214 transitions. [2019-09-08 12:23:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:46,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:46,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] [2019-09-08 12:23:46,649 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash 747056842, now seen corresponding path program 1 times [2019-09-08 12:23:46,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:46,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:46,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:46,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:46,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:46,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:23:46,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:46,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:46,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:46,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:46,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:46,836 INFO L87 Difference]: Start difference. First operand 905 states and 1214 transitions. Second operand 9 states. [2019-09-08 12:23:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:49,053 INFO L93 Difference]: Finished difference Result 1832 states and 2526 transitions. [2019-09-08 12:23:49,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:49,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:49,056 INFO L225 Difference]: With dead ends: 1832 [2019-09-08 12:23:49,056 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:49,057 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:23:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1213 transitions. [2019-09-08 12:23:49,147 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1213 transitions. Word has length 99 [2019-09-08 12:23:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:49,147 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1213 transitions. [2019-09-08 12:23:49,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1213 transitions. [2019-09-08 12:23:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:49,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:49,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:49,149 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:49,149 INFO L82 PathProgramCache]: Analyzing trace with hash 358054313, now seen corresponding path program 1 times [2019-09-08 12:23:49,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:49,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:49,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:49,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:49,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:49,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:49,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:49,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:49,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:49,307 INFO L87 Difference]: Start difference. First operand 905 states and 1213 transitions. Second operand 9 states. [2019-09-08 12:23:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:51,551 INFO L93 Difference]: Finished difference Result 1828 states and 2520 transitions. [2019-09-08 12:23:51,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:51,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:51,553 INFO L225 Difference]: With dead ends: 1828 [2019-09-08 12:23:51,553 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:51,553 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:23:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1212 transitions. [2019-09-08 12:23:51,638 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1212 transitions. Word has length 99 [2019-09-08 12:23:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:51,638 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1212 transitions. [2019-09-08 12:23:51,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1212 transitions. [2019-09-08 12:23:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:23:51,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:51,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:51,639 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash 656430520, now seen corresponding path program 1 times [2019-09-08 12:23:51,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:51,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:51,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:51,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:51,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:51,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:51,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:51,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:51,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:51,811 INFO L87 Difference]: Start difference. First operand 905 states and 1212 transitions. Second operand 9 states. [2019-09-08 12:23:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:54,461 INFO L93 Difference]: Finished difference Result 1936 states and 2678 transitions. [2019-09-08 12:23:54,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:54,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:23:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:54,463 INFO L225 Difference]: With dead ends: 1936 [2019-09-08 12:23:54,463 INFO L226 Difference]: Without dead ends: 1726 [2019-09-08 12:23:54,464 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:23:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-08 12:23:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 905. [2019-09-08 12:23:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1211 transitions. [2019-09-08 12:23:54,556 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1211 transitions. Word has length 99 [2019-09-08 12:23:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:54,556 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1211 transitions. [2019-09-08 12:23:54,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1211 transitions. [2019-09-08 12:23:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:23:54,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:54,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:54,558 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1803814491, now seen corresponding path program 1 times [2019-09-08 12:23:54,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:54,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:54,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:54,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:54,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:54,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:54,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:54,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:54,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:54,710 INFO L87 Difference]: Start difference. First operand 905 states and 1211 transitions. Second operand 9 states. [2019-09-08 12:23:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:56,798 INFO L93 Difference]: Finished difference Result 1780 states and 2441 transitions. [2019-09-08 12:23:56,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:56,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:23:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:56,801 INFO L225 Difference]: With dead ends: 1780 [2019-09-08 12:23:56,801 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:23:56,802 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:23:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:23:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:23:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1209 transitions. [2019-09-08 12:23:56,946 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1209 transitions. Word has length 101 [2019-09-08 12:23:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:56,946 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1209 transitions. [2019-09-08 12:23:56,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1209 transitions. [2019-09-08 12:23:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:23:56,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:56,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:56,948 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:56,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash 125342021, now seen corresponding path program 1 times [2019-09-08 12:23:56,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:56,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:57,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:57,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:57,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:57,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:57,111 INFO L87 Difference]: Start difference. First operand 905 states and 1209 transitions. Second operand 9 states. [2019-09-08 12:23:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:59,405 INFO L93 Difference]: Finished difference Result 1844 states and 2535 transitions. [2019-09-08 12:23:59,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:59,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:23:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:59,408 INFO L225 Difference]: With dead ends: 1844 [2019-09-08 12:23:59,408 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:23:59,408 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:23:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:23:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:23:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:23:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1207 transitions. [2019-09-08 12:23:59,501 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1207 transitions. Word has length 101 [2019-09-08 12:23:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:59,502 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1207 transitions. [2019-09-08 12:23:59,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1207 transitions. [2019-09-08 12:23:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:23:59,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:59,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:59,504 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2143197222, now seen corresponding path program 1 times [2019-09-08 12:23:59,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:59,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:59,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:59,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:59,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:59,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:59,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:59,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:59,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:59,653 INFO L87 Difference]: Start difference. First operand 905 states and 1207 transitions. Second operand 9 states. [2019-09-08 12:24:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:02,056 INFO L93 Difference]: Finished difference Result 1900 states and 2615 transitions. [2019-09-08 12:24:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:02,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:02,059 INFO L225 Difference]: With dead ends: 1900 [2019-09-08 12:24:02,059 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:24:02,060 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:24:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:24:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-08 12:24:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1205 transitions. [2019-09-08 12:24:02,159 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1205 transitions. Word has length 101 [2019-09-08 12:24:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:02,159 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1205 transitions. [2019-09-08 12:24:02,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1205 transitions. [2019-09-08 12:24:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:02,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:02,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:02,161 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:02,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash 666625533, now seen corresponding path program 1 times [2019-09-08 12:24:02,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:02,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:02,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:02,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:02,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:02,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:02,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:02,315 INFO L87 Difference]: Start difference. First operand 905 states and 1205 transitions. Second operand 9 states. [2019-09-08 12:24:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:04,798 INFO L93 Difference]: Finished difference Result 1780 states and 2435 transitions. [2019-09-08 12:24:04,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:04,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:04,801 INFO L225 Difference]: With dead ends: 1780 [2019-09-08 12:24:04,801 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:04,802 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:24:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1203 transitions. [2019-09-08 12:24:04,898 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1203 transitions. Word has length 101 [2019-09-08 12:24:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:04,898 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1203 transitions. [2019-09-08 12:24:04,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1203 transitions. [2019-09-08 12:24:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:04,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:04,900 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:04,900 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:04,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:04,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1503001015, now seen corresponding path program 1 times [2019-09-08 12:24:04,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:04,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:04,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:05,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:05,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:05,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:05,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:05,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:05,051 INFO L87 Difference]: Start difference. First operand 905 states and 1203 transitions. Second operand 9 states. [2019-09-08 12:24:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:07,167 INFO L93 Difference]: Finished difference Result 1776 states and 2426 transitions. [2019-09-08 12:24:07,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:07,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:07,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:07,169 INFO L225 Difference]: With dead ends: 1776 [2019-09-08 12:24:07,169 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:07,170 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:24:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1201 transitions. [2019-09-08 12:24:07,265 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1201 transitions. Word has length 101 [2019-09-08 12:24:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:07,266 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1201 transitions. [2019-09-08 12:24:07,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1201 transitions. [2019-09-08 12:24:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:07,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:07,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:07,267 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1720349999, now seen corresponding path program 1 times [2019-09-08 12:24:07,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:07,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:07,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:07,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:07,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:07,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:07,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:07,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:07,427 INFO L87 Difference]: Start difference. First operand 905 states and 1201 transitions. Second operand 9 states. [2019-09-08 12:24:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:09,501 INFO L93 Difference]: Finished difference Result 1888 states and 2593 transitions. [2019-09-08 12:24:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:09,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:09,503 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:24:09,503 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 12:24:09,504 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:24:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 12:24:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 905. [2019-09-08 12:24:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1199 transitions. [2019-09-08 12:24:09,604 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1199 transitions. Word has length 101 [2019-09-08 12:24:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:09,605 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1199 transitions. [2019-09-08 12:24:09,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1199 transitions. [2019-09-08 12:24:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:09,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:09,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:09,606 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1464481640, now seen corresponding path program 1 times [2019-09-08 12:24:09,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:09,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:09,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:09,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:09,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:09,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:09,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:09,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:09,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:09,751 INFO L87 Difference]: Start difference. First operand 905 states and 1199 transitions. Second operand 9 states. [2019-09-08 12:24:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:12,186 INFO L93 Difference]: Finished difference Result 1772 states and 2418 transitions. [2019-09-08 12:24:12,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:12,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:12,188 INFO L225 Difference]: With dead ends: 1772 [2019-09-08 12:24:12,189 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:12,190 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:24:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1197 transitions. [2019-09-08 12:24:12,293 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1197 transitions. Word has length 101 [2019-09-08 12:24:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:12,294 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1197 transitions. [2019-09-08 12:24:12,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1197 transitions. [2019-09-08 12:24:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:12,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:12,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:12,295 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash -22612664, now seen corresponding path program 1 times [2019-09-08 12:24:12,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:12,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:12,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:12,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:12,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:12,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:12,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:12,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:12,462 INFO L87 Difference]: Start difference. First operand 905 states and 1197 transitions. Second operand 9 states. [2019-09-08 12:24:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:14,860 INFO L93 Difference]: Finished difference Result 1836 states and 2513 transitions. [2019-09-08 12:24:14,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:14,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:14,862 INFO L225 Difference]: With dead ends: 1836 [2019-09-08 12:24:14,862 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:24:14,863 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:24:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:24:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:24:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1195 transitions. [2019-09-08 12:24:14,966 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1195 transitions. Word has length 101 [2019-09-08 12:24:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:14,967 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1195 transitions. [2019-09-08 12:24:14,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1195 transitions. [2019-09-08 12:24:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:14,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:14,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:14,969 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1367426141, now seen corresponding path program 1 times [2019-09-08 12:24:14,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:14,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:15,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:24:15,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:15,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:15,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:15,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:15,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:15,112 INFO L87 Difference]: Start difference. First operand 905 states and 1195 transitions. Second operand 9 states. [2019-09-08 12:24:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:17,731 INFO L93 Difference]: Finished difference Result 1691 states and 2289 transitions. [2019-09-08 12:24:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:17,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:17,734 INFO L225 Difference]: With dead ends: 1691 [2019-09-08 12:24:17,734 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:24:17,734 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:24:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:24:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:24:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1193 transitions. [2019-09-08 12:24:17,843 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1193 transitions. Word has length 101 [2019-09-08 12:24:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:17,843 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1193 transitions. [2019-09-08 12:24:17,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1193 transitions. [2019-09-08 12:24:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:17,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:17,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:17,845 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash -982377980, now seen corresponding path program 1 times [2019-09-08 12:24:17,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:17,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:17,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:17,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:17,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:17,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:17,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:17,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:17,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:17,999 INFO L87 Difference]: Start difference. First operand 905 states and 1193 transitions. Second operand 9 states. [2019-09-08 12:24:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:20,151 INFO L93 Difference]: Finished difference Result 1631 states and 2196 transitions. [2019-09-08 12:24:20,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:20,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:20,153 INFO L225 Difference]: With dead ends: 1631 [2019-09-08 12:24:20,153 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:20,154 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:24:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1191 transitions. [2019-09-08 12:24:20,261 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1191 transitions. Word has length 101 [2019-09-08 12:24:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:20,261 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1191 transitions. [2019-09-08 12:24:20,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1191 transitions. [2019-09-08 12:24:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:20,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:20,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:20,263 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:20,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1167978122, now seen corresponding path program 1 times [2019-09-08 12:24:20,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:20,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:20,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:20,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:24:20,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:20,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:20,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:20,415 INFO L87 Difference]: Start difference. First operand 905 states and 1191 transitions. Second operand 9 states. [2019-09-08 12:24:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:22,988 INFO L93 Difference]: Finished difference Result 1631 states and 2194 transitions. [2019-09-08 12:24:22,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:22,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:22,990 INFO L225 Difference]: With dead ends: 1631 [2019-09-08 12:24:22,990 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:22,990 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:24:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1189 transitions. [2019-09-08 12:24:23,097 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1189 transitions. Word has length 101 [2019-09-08 12:24:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:23,098 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1189 transitions. [2019-09-08 12:24:23,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1189 transitions. [2019-09-08 12:24:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:23,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:23,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:23,099 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 105604818, now seen corresponding path program 1 times [2019-09-08 12:24:23,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:23,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:23,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:23,245 INFO L87 Difference]: Start difference. First operand 905 states and 1189 transitions. Second operand 9 states. [2019-09-08 12:24:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:25,514 INFO L93 Difference]: Finished difference Result 1776 states and 2410 transitions. [2019-09-08 12:24:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:25,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:25,516 INFO L225 Difference]: With dead ends: 1776 [2019-09-08 12:24:25,516 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:25,517 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:24:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1187 transitions. [2019-09-08 12:24:25,627 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1187 transitions. Word has length 101 [2019-09-08 12:24:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:25,627 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1187 transitions. [2019-09-08 12:24:25,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1187 transitions. [2019-09-08 12:24:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:25,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:25,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:25,629 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1810364723, now seen corresponding path program 1 times [2019-09-08 12:24:25,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:25,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:25,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:25,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:25,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:25,782 INFO L87 Difference]: Start difference. First operand 905 states and 1187 transitions. Second operand 9 states. [2019-09-08 12:24:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:27,991 INFO L93 Difference]: Finished difference Result 1774 states and 2406 transitions. [2019-09-08 12:24:27,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:27,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:27,993 INFO L225 Difference]: With dead ends: 1774 [2019-09-08 12:24:27,993 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:27,994 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:24:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1186 transitions. [2019-09-08 12:24:28,121 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1186 transitions. Word has length 101 [2019-09-08 12:24:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:28,121 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1186 transitions. [2019-09-08 12:24:28,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1186 transitions. [2019-09-08 12:24:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:28,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:28,123 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:28,123 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:28,123 INFO L82 PathProgramCache]: Analyzing trace with hash -668731238, now seen corresponding path program 1 times [2019-09-08 12:24:28,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:28,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:28,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:28,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:28,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:28,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:24:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:28,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:28,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:28,266 INFO L87 Difference]: Start difference. First operand 905 states and 1186 transitions. Second operand 9 states. [2019-09-08 12:24:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:30,722 INFO L93 Difference]: Finished difference Result 1772 states and 2402 transitions. [2019-09-08 12:24:30,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:30,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:30,724 INFO L225 Difference]: With dead ends: 1772 [2019-09-08 12:24:30,725 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:30,725 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:24:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1185 transitions. [2019-09-08 12:24:30,843 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1185 transitions. Word has length 101 [2019-09-08 12:24:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:30,844 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1185 transitions. [2019-09-08 12:24:30,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1185 transitions. [2019-09-08 12:24:30,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:30,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:30,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:30,845 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:30,846 INFO L82 PathProgramCache]: Analyzing trace with hash 266353513, now seen corresponding path program 1 times [2019-09-08 12:24:30,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:30,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:30,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:30,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:30,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:30,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:30,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:30,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:30,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:30,991 INFO L87 Difference]: Start difference. First operand 905 states and 1185 transitions. Second operand 9 states. [2019-09-08 12:24:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:33,327 INFO L93 Difference]: Finished difference Result 1774 states and 2403 transitions. [2019-09-08 12:24:33,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:33,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:33,329 INFO L225 Difference]: With dead ends: 1774 [2019-09-08 12:24:33,329 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:33,330 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:24:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1184 transitions. [2019-09-08 12:24:33,446 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1184 transitions. Word has length 101 [2019-09-08 12:24:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:33,447 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1184 transitions. [2019-09-08 12:24:33,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1184 transitions. [2019-09-08 12:24:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:33,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:33,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] [2019-09-08 12:24:33,448 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:33,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1006473754, now seen corresponding path program 1 times [2019-09-08 12:24:33,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:33,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:33,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:33,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:33,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:33,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:33,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:33,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:33,585 INFO L87 Difference]: Start difference. First operand 905 states and 1184 transitions. Second operand 9 states. [2019-09-08 12:24:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:35,948 INFO L93 Difference]: Finished difference Result 1631 states and 2184 transitions. [2019-09-08 12:24:35,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:35,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:35,951 INFO L225 Difference]: With dead ends: 1631 [2019-09-08 12:24:35,951 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:35,952 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:24:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1183 transitions. [2019-09-08 12:24:36,133 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1183 transitions. Word has length 101 [2019-09-08 12:24:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:36,134 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1183 transitions. [2019-09-08 12:24:36,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1183 transitions. [2019-09-08 12:24:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:36,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:36,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:36,136 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash 411987299, now seen corresponding path program 1 times [2019-09-08 12:24:36,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:36,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:36,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:36,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:36,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:36,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:36,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:36,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:36,286 INFO L87 Difference]: Start difference. First operand 905 states and 1183 transitions. Second operand 9 states. [2019-09-08 12:24:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:38,742 INFO L93 Difference]: Finished difference Result 1772 states and 2398 transitions. [2019-09-08 12:24:38,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:38,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:38,745 INFO L225 Difference]: With dead ends: 1772 [2019-09-08 12:24:38,745 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:38,745 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:24:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1182 transitions. [2019-09-08 12:24:38,881 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1182 transitions. Word has length 101 [2019-09-08 12:24:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:38,881 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1182 transitions. [2019-09-08 12:24:38,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1182 transitions. [2019-09-08 12:24:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:38,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:38,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:38,883 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash 135143125, now seen corresponding path program 1 times [2019-09-08 12:24:38,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:38,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:38,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:38,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:38,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:39,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:24:39,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:39,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:39,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:39,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:39,016 INFO L87 Difference]: Start difference. First operand 905 states and 1182 transitions. Second operand 9 states. [2019-09-08 12:24:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:41,424 INFO L93 Difference]: Finished difference Result 1772 states and 2396 transitions. [2019-09-08 12:24:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:41,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:41,426 INFO L225 Difference]: With dead ends: 1772 [2019-09-08 12:24:41,426 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:41,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:24:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1181 transitions. [2019-09-08 12:24:41,548 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1181 transitions. Word has length 101 [2019-09-08 12:24:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:41,548 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1181 transitions. [2019-09-08 12:24:41,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1181 transitions. [2019-09-08 12:24:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:41,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:41,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:41,550 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash 160216056, now seen corresponding path program 1 times [2019-09-08 12:24:41,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:41,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:41,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:41,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:24:41,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:41,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:41,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:41,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:41,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:41,701 INFO L87 Difference]: Start difference. First operand 905 states and 1181 transitions. Second operand 9 states. [2019-09-08 12:24:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:44,153 INFO L93 Difference]: Finished difference Result 1837 states and 2489 transitions. [2019-09-08 12:24:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:44,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:44,155 INFO L225 Difference]: With dead ends: 1837 [2019-09-08 12:24:44,155 INFO L226 Difference]: Without dead ends: 1674 [2019-09-08 12:24:44,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-08 12:24:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 905. [2019-09-08 12:24:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1180 transitions. [2019-09-08 12:24:44,280 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1180 transitions. Word has length 101 [2019-09-08 12:24:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:44,281 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1180 transitions. [2019-09-08 12:24:44,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1180 transitions. [2019-09-08 12:24:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:44,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:44,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:44,283 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:44,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1768940456, now seen corresponding path program 1 times [2019-09-08 12:24:44,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:44,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:44,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:24:44,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:44,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:44,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:44,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:44,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:44,414 INFO L87 Difference]: Start difference. First operand 905 states and 1180 transitions. Second operand 9 states. [2019-09-08 12:24:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:46,689 INFO L93 Difference]: Finished difference Result 1777 states and 2399 transitions. [2019-09-08 12:24:46,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:46,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:46,691 INFO L225 Difference]: With dead ends: 1777 [2019-09-08 12:24:46,691 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:46,692 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:24:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1179 transitions. [2019-09-08 12:24:46,815 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1179 transitions. Word has length 101 [2019-09-08 12:24:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:46,815 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1179 transitions. [2019-09-08 12:24:46,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1179 transitions. [2019-09-08 12:24:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:46,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:46,817 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:46,817 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:46,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1364812236, now seen corresponding path program 1 times [2019-09-08 12:24:46,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:46,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:46,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:47,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:24:47,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:47,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:47,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:47,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:47,017 INFO L87 Difference]: Start difference. First operand 905 states and 1179 transitions. Second operand 9 states. [2019-09-08 12:24:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:49,583 INFO L93 Difference]: Finished difference Result 1777 states and 2398 transitions. [2019-09-08 12:24:49,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:49,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:49,586 INFO L225 Difference]: With dead ends: 1777 [2019-09-08 12:24:49,586 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:49,587 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:24:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1178 transitions. [2019-09-08 12:24:49,717 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1178 transitions. Word has length 101 [2019-09-08 12:24:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:49,718 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1178 transitions. [2019-09-08 12:24:49,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1178 transitions. [2019-09-08 12:24:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:49,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:49,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:49,720 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash -805496503, now seen corresponding path program 1 times [2019-09-08 12:24:49,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:49,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:49,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:49,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:49,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:49,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:49,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:49,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:49,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:49,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:49,862 INFO L87 Difference]: Start difference. First operand 905 states and 1178 transitions. Second operand 9 states. [2019-09-08 12:24:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:52,126 INFO L93 Difference]: Finished difference Result 1774 states and 2393 transitions. [2019-09-08 12:24:52,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:52,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:52,128 INFO L225 Difference]: With dead ends: 1774 [2019-09-08 12:24:52,128 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:52,129 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:24:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1177 transitions. [2019-09-08 12:24:52,260 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1177 transitions. Word has length 101 [2019-09-08 12:24:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:52,260 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1177 transitions. [2019-09-08 12:24:52,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1177 transitions. [2019-09-08 12:24:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:52,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:52,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:52,261 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:52,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1984318311, now seen corresponding path program 1 times [2019-09-08 12:24:52,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:52,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:52,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:52,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:52,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:52,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:24:52,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:52,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:52,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:52,406 INFO L87 Difference]: Start difference. First operand 905 states and 1177 transitions. Second operand 9 states. [2019-09-08 12:24:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:54,761 INFO L93 Difference]: Finished difference Result 1774 states and 2392 transitions. [2019-09-08 12:24:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:54,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:54,764 INFO L225 Difference]: With dead ends: 1774 [2019-09-08 12:24:54,764 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:54,765 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:24:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1176 transitions. [2019-09-08 12:24:54,901 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1176 transitions. Word has length 101 [2019-09-08 12:24:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:54,901 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1176 transitions. [2019-09-08 12:24:54,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1176 transitions. [2019-09-08 12:24:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:54,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:54,903 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:54,903 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:54,903 INFO L82 PathProgramCache]: Analyzing trace with hash -140231016, now seen corresponding path program 1 times [2019-09-08 12:24:54,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:54,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:54,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:54,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:54,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:55,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:55,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:55,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:55,032 INFO L87 Difference]: Start difference. First operand 905 states and 1176 transitions. Second operand 9 states. [2019-09-08 12:24:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:57,506 INFO L93 Difference]: Finished difference Result 1777 states and 2394 transitions. [2019-09-08 12:24:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:57,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:24:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:57,508 INFO L225 Difference]: With dead ends: 1777 [2019-09-08 12:24:57,509 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:24:57,509 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:24:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:24:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:24:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:24:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1175 transitions. [2019-09-08 12:24:57,640 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1175 transitions. Word has length 101 [2019-09-08 12:24:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:57,641 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1175 transitions. [2019-09-08 12:24:57,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1175 transitions. [2019-09-08 12:24:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:24:57,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:57,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:57,642 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1539223594, now seen corresponding path program 1 times [2019-09-08 12:24:57,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:57,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:57,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:57,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:57,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:57,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:57,839 INFO L87 Difference]: Start difference. First operand 905 states and 1175 transitions. Second operand 9 states. [2019-09-08 12:25:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:00,281 INFO L93 Difference]: Finished difference Result 1774 states and 2389 transitions. [2019-09-08 12:25:00,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:00,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:25:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:00,284 INFO L225 Difference]: With dead ends: 1774 [2019-09-08 12:25:00,284 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:25:00,284 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:25:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:25:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:25:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:25:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1174 transitions. [2019-09-08 12:25:00,419 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1174 transitions. Word has length 101 [2019-09-08 12:25:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:00,420 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1174 transitions. [2019-09-08 12:25:00,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1174 transitions. [2019-09-08 12:25:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:25:00,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:00,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:00,421 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:00,421 INFO L82 PathProgramCache]: Analyzing trace with hash 156727661, now seen corresponding path program 1 times [2019-09-08 12:25:00,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:00,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:00,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:00,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:00,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:00,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:00,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:00,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:00,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:00,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:00,562 INFO L87 Difference]: Start difference. First operand 905 states and 1174 transitions. Second operand 9 states. [2019-09-08 12:25:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:02,854 INFO L93 Difference]: Finished difference Result 1773 states and 2386 transitions. [2019-09-08 12:25:02,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:02,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:25:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:02,856 INFO L225 Difference]: With dead ends: 1773 [2019-09-08 12:25:02,856 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:25:02,857 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:25:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:25:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:25:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:25:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1173 transitions. [2019-09-08 12:25:02,994 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1173 transitions. Word has length 102 [2019-09-08 12:25:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:02,995 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1173 transitions. [2019-09-08 12:25:02,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1173 transitions. [2019-09-08 12:25:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:25:02,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:02,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:02,996 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1086833095, now seen corresponding path program 1 times [2019-09-08 12:25:02,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:02,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:02,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:03,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:03,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:03,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:03,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:03,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:03,114 INFO L87 Difference]: Start difference. First operand 905 states and 1173 transitions. Second operand 9 states. [2019-09-08 12:25:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:05,582 INFO L93 Difference]: Finished difference Result 1772 states and 2384 transitions. [2019-09-08 12:25:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:05,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:25:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:05,584 INFO L225 Difference]: With dead ends: 1772 [2019-09-08 12:25:05,584 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:25:05,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:25:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:25:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:25:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1172 transitions. [2019-09-08 12:25:05,721 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1172 transitions. Word has length 102 [2019-09-08 12:25:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:05,721 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1172 transitions. [2019-09-08 12:25:05,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1172 transitions. [2019-09-08 12:25:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:25:05,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:05,722 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:05,723 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash 725509289, now seen corresponding path program 1 times [2019-09-08 12:25:05,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:05,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:05,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:08,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:08,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:25:08,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:25:08,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:25:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:25:08,271 INFO L87 Difference]: Start difference. First operand 905 states and 1172 transitions. Second operand 31 states. [2019-09-08 12:25:08,456 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:25:09,600 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:25:10,080 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 12:25:10,477 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-08 12:25:10,929 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-09-08 12:25:11,563 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 125 [2019-09-08 12:25:13,312 WARN L188 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 161 DAG size of output: 145 [2019-09-08 12:25:13,601 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:25:13,873 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:25:14,048 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 12:25:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:31,536 INFO L93 Difference]: Finished difference Result 2400 states and 3211 transitions. [2019-09-08 12:25:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:25:31,536 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-09-08 12:25:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:31,538 INFO L225 Difference]: With dead ends: 2400 [2019-09-08 12:25:31,538 INFO L226 Difference]: Without dead ends: 2247 [2019-09-08 12:25:31,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=481, Invalid=2941, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 12:25:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2019-09-08 12:25:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 924. [2019-09-08 12:25:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-09-08 12:25:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1196 transitions. [2019-09-08 12:25:31,694 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1196 transitions. Word has length 103 [2019-09-08 12:25:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:31,694 INFO L475 AbstractCegarLoop]: Abstraction has 924 states and 1196 transitions. [2019-09-08 12:25:31,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:25:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1196 transitions. [2019-09-08 12:25:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:25:31,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:31,696 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:31,696 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:31,696 INFO L82 PathProgramCache]: Analyzing trace with hash -841243648, now seen corresponding path program 1 times [2019-09-08 12:25:31,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:31,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:31,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:32,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:32,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:25:32,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:25:32,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:25:32,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:25:32,491 INFO L87 Difference]: Start difference. First operand 924 states and 1196 transitions. Second operand 17 states. [2019-09-08 12:25:33,110 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:25:33,253 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:25:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:37,066 INFO L93 Difference]: Finished difference Result 2017 states and 2710 transitions. [2019-09-08 12:25:37,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:25:37,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:25:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:37,069 INFO L225 Difference]: With dead ends: 2017 [2019-09-08 12:25:37,069 INFO L226 Difference]: Without dead ends: 1821 [2019-09-08 12:25:37,070 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:25:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2019-09-08 12:25:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 885. [2019-09-08 12:25:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-09-08 12:25:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1143 transitions. [2019-09-08 12:25:37,235 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1143 transitions. Word has length 103 [2019-09-08 12:25:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:37,235 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1143 transitions. [2019-09-08 12:25:37,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:25:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1143 transitions. [2019-09-08 12:25:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:25:37,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:37,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:37,237 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:37,238 INFO L82 PathProgramCache]: Analyzing trace with hash 75685686, now seen corresponding path program 1 times [2019-09-08 12:25:37,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:37,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:37,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:37,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:37,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:38,254 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:25:38,408 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:25:38,565 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 12:25:38,732 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 12:25:38,899 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:25:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:40,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:40,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:25:40,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:25:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:25:40,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:25:40,237 INFO L87 Difference]: Start difference. First operand 885 states and 1143 transitions. Second operand 31 states. [2019-09-08 12:25:40,466 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-08 12:25:41,738 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-08 12:25:41,945 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-09-08 12:25:42,504 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-08 12:25:42,836 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-09-08 12:25:43,202 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2019-09-08 12:25:43,620 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 73 [2019-09-08 12:25:44,144 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2019-09-08 12:25:44,494 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-08 12:25:44,858 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-08 12:25:45,058 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 12:25:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:58,791 INFO L93 Difference]: Finished difference Result 1357 states and 1783 transitions. [2019-09-08 12:25:58,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:25:58,791 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-09-08 12:25:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:58,793 INFO L225 Difference]: With dead ends: 1357 [2019-09-08 12:25:58,793 INFO L226 Difference]: Without dead ends: 1207 [2019-09-08 12:25:58,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 12:25:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-09-08 12:25:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 905. [2019-09-08 12:25:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:25:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1170 transitions. [2019-09-08 12:25:58,988 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1170 transitions. Word has length 103 [2019-09-08 12:25:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:58,989 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1170 transitions. [2019-09-08 12:25:58,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:25:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1170 transitions. [2019-09-08 12:25:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:25:58,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:58,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:58,991 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1062800595, now seen corresponding path program 1 times [2019-09-08 12:25:58,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:58,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:58,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:58,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:58,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:59,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:25:59,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:59,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:25:59,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:25:59,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:25:59,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:25:59,767 INFO L87 Difference]: Start difference. First operand 905 states and 1170 transitions. Second operand 17 states. [2019-09-08 12:26:00,391 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:26:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:03,013 INFO L93 Difference]: Finished difference Result 2007 states and 2698 transitions. [2019-09-08 12:26:03,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:26:03,014 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:26:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:03,015 INFO L225 Difference]: With dead ends: 2007 [2019-09-08 12:26:03,015 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:26:03,016 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:26:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:26:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 859. [2019-09-08 12:26:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-09-08 12:26:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1107 transitions. [2019-09-08 12:26:03,200 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1107 transitions. Word has length 103 [2019-09-08 12:26:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:03,200 INFO L475 AbstractCegarLoop]: Abstraction has 859 states and 1107 transitions. [2019-09-08 12:26:03,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:26:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1107 transitions. [2019-09-08 12:26:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:26:03,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:03,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] [2019-09-08 12:26:03,202 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:03,202 INFO L82 PathProgramCache]: Analyzing trace with hash 559668261, now seen corresponding path program 1 times [2019-09-08 12:26:03,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:03,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:03,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:03,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:03,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:26:03,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:26:03,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:26:03,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:26:03,926 INFO L87 Difference]: Start difference. First operand 859 states and 1107 transitions. Second operand 17 states. [2019-09-08 12:26:04,556 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:26:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:07,070 INFO L93 Difference]: Finished difference Result 1943 states and 2609 transitions. [2019-09-08 12:26:07,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:26:07,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:26:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:07,073 INFO L225 Difference]: With dead ends: 1943 [2019-09-08 12:26:07,073 INFO L226 Difference]: Without dead ends: 1715 [2019-09-08 12:26:07,074 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:26:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-09-08 12:26:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 823. [2019-09-08 12:26:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-08 12:26:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1055 transitions. [2019-09-08 12:26:07,269 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1055 transitions. Word has length 103 [2019-09-08 12:26:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:07,270 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1055 transitions. [2019-09-08 12:26:07,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:26:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1055 transitions. [2019-09-08 12:26:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:26:07,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:07,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:07,271 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash -171293856, now seen corresponding path program 1 times [2019-09-08 12:26:07,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:07,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:07,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:07,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:07,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:08,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:08,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:26:08,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:26:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:26:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:26:08,091 INFO L87 Difference]: Start difference. First operand 823 states and 1055 transitions. Second operand 16 states. [2019-09-08 12:26:08,752 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:26:08,881 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:26:09,007 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:26:09,133 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:26:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:12,476 INFO L93 Difference]: Finished difference Result 1285 states and 1623 transitions. [2019-09-08 12:26:12,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:26:12,477 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-08 12:26:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:12,478 INFO L225 Difference]: With dead ends: 1285 [2019-09-08 12:26:12,478 INFO L226 Difference]: Without dead ends: 1281 [2019-09-08 12:26:12,478 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:26:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-08 12:26:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 829. [2019-09-08 12:26:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-08 12:26:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1063 transitions. [2019-09-08 12:26:12,687 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1063 transitions. Word has length 103 [2019-09-08 12:26:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:12,687 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1063 transitions. [2019-09-08 12:26:12,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:26:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1063 transitions. [2019-09-08 12:26:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:26:12,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:12,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:12,689 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1183554526, now seen corresponding path program 1 times [2019-09-08 12:26:12,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:12,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:12,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:13,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:13,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:26:13,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:26:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:26:13,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:26:13,503 INFO L87 Difference]: Start difference. First operand 829 states and 1063 transitions. Second operand 16 states. [2019-09-08 12:26:14,211 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:26:14,364 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:26:14,512 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:26:14,697 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:26:14,875 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:26:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:18,520 INFO L93 Difference]: Finished difference Result 1403 states and 1817 transitions. [2019-09-08 12:26:18,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:26:18,520 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-08 12:26:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:18,522 INFO L225 Difference]: With dead ends: 1403 [2019-09-08 12:26:18,522 INFO L226 Difference]: Without dead ends: 1256 [2019-09-08 12:26:18,523 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:26:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-08 12:26:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 828. [2019-09-08 12:26:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-09-08 12:26:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1061 transitions. [2019-09-08 12:26:18,716 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1061 transitions. Word has length 103 [2019-09-08 12:26:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:18,716 INFO L475 AbstractCegarLoop]: Abstraction has 828 states and 1061 transitions. [2019-09-08 12:26:18,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:26:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1061 transitions. [2019-09-08 12:26:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:26:18,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:18,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:18,718 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash 739529577, now seen corresponding path program 1 times [2019-09-08 12:26:18,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:18,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:18,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:18,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:18,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:19,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:19,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:26:19,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:26:19,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:26:19,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:26:19,997 INFO L87 Difference]: Start difference. First operand 828 states and 1061 transitions. Second operand 22 states. [2019-09-08 12:26:21,013 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-08 12:26:21,267 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 12:26:21,555 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-08 12:26:21,713 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 12:26:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:25,178 INFO L93 Difference]: Finished difference Result 1522 states and 2015 transitions. [2019-09-08 12:26:25,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:26:25,178 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2019-09-08 12:26:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:25,180 INFO L225 Difference]: With dead ends: 1522 [2019-09-08 12:26:25,180 INFO L226 Difference]: Without dead ends: 1283 [2019-09-08 12:26:25,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:26:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-09-08 12:26:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 840. [2019-09-08 12:26:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-09-08 12:26:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1073 transitions. [2019-09-08 12:26:25,379 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1073 transitions. Word has length 103 [2019-09-08 12:26:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:25,379 INFO L475 AbstractCegarLoop]: Abstraction has 840 states and 1073 transitions. [2019-09-08 12:26:25,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:26:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1073 transitions. [2019-09-08 12:26:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:26:25,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:25,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:25,381 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1338576063, now seen corresponding path program 1 times [2019-09-08 12:26:25,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:25,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:25,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:26,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:26,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:26:26,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:26:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:26:26,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:26:26,110 INFO L87 Difference]: Start difference. First operand 840 states and 1073 transitions. Second operand 17 states. [2019-09-08 12:26:26,692 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:26:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:28,732 INFO L93 Difference]: Finished difference Result 1449 states and 1945 transitions. [2019-09-08 12:26:28,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:26:28,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:26:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:28,734 INFO L225 Difference]: With dead ends: 1449 [2019-09-08 12:26:28,734 INFO L226 Difference]: Without dead ends: 1213 [2019-09-08 12:26:28,735 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:26:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-08 12:26:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 800. [2019-09-08 12:26:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-09-08 12:26:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1017 transitions. [2019-09-08 12:26:28,938 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1017 transitions. Word has length 103 [2019-09-08 12:26:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:28,938 INFO L475 AbstractCegarLoop]: Abstraction has 800 states and 1017 transitions. [2019-09-08 12:26:28,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:26:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1017 transitions. [2019-09-08 12:26:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:26:28,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:28,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:28,940 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash -120255204, now seen corresponding path program 1 times [2019-09-08 12:26:28,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:28,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:28,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:28,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:28,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:29,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:26:29,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:29,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:26:29,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:26:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:26:29,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:26:29,859 INFO L87 Difference]: Start difference. First operand 800 states and 1017 transitions. Second operand 17 states. [2019-09-08 12:26:30,458 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 12:26:30,600 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:26:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:34,211 INFO L93 Difference]: Finished difference Result 1693 states and 2267 transitions. [2019-09-08 12:26:34,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:26:34,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:26:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:34,213 INFO L225 Difference]: With dead ends: 1693 [2019-09-08 12:26:34,213 INFO L226 Difference]: Without dead ends: 1540 [2019-09-08 12:26:34,214 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:26:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-09-08 12:26:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 799. [2019-09-08 12:26:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-09-08 12:26:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1014 transitions. [2019-09-08 12:26:34,420 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1014 transitions. Word has length 103 [2019-09-08 12:26:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:34,420 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1014 transitions. [2019-09-08 12:26:34,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:26:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1014 transitions. [2019-09-08 12:26:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:26:34,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:34,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:34,421 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1687008141, now seen corresponding path program 1 times [2019-09-08 12:26:34,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:34,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:34,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:35,310 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:26:35,458 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 12:26:35,608 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-08 12:26:36,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:26:36,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:36,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 12:26:36,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 12:26:36,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 12:26:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:26:36,615 INFO L87 Difference]: Start difference. First operand 799 states and 1014 transitions. Second operand 30 states. [2019-09-08 12:26:36,819 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 12:26:37,809 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-08 12:26:37,984 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-08 12:26:38,275 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 12:26:38,754 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-09-08 12:26:39,136 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-09-08 12:26:39,596 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2019-09-08 12:26:40,120 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2019-09-08 12:26:40,432 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-08 12:26:40,728 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-08 12:26:41,031 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-08 12:26:41,309 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-08 12:26:41,566 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-08 12:26:41,985 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-08 12:26:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:51,657 INFO L93 Difference]: Finished difference Result 1491 states and 1965 transitions. [2019-09-08 12:26:51,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 12:26:51,657 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 103 [2019-09-08 12:26:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:51,659 INFO L225 Difference]: With dead ends: 1491 [2019-09-08 12:26:51,659 INFO L226 Difference]: Without dead ends: 1317 [2019-09-08 12:26:51,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=544, Invalid=2108, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 12:26:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-09-08 12:26:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 815. [2019-09-08 12:26:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-09-08 12:26:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1032 transitions. [2019-09-08 12:26:51,922 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1032 transitions. Word has length 103 [2019-09-08 12:26:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:51,922 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1032 transitions. [2019-09-08 12:26:51,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 12:26:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1032 transitions. [2019-09-08 12:26:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:26:51,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:51,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:51,924 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 644009232, now seen corresponding path program 1 times [2019-09-08 12:26:51,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:51,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:51,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:51,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:51,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:52,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:52,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:26:52,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:26:52,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:26:52,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:26:52,961 INFO L87 Difference]: Start difference. First operand 815 states and 1032 transitions. Second operand 20 states. [2019-09-08 12:26:53,903 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-08 12:26:54,149 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-09-08 12:26:54,340 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 12:26:54,537 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 12:26:54,716 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-08 12:26:54,866 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:26:55,017 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:26:55,249 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-08 12:26:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:58,637 INFO L93 Difference]: Finished difference Result 1470 states and 1943 transitions. [2019-09-08 12:26:58,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:26:58,638 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2019-09-08 12:26:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:58,641 INFO L225 Difference]: With dead ends: 1470 [2019-09-08 12:26:58,641 INFO L226 Difference]: Without dead ends: 1206 [2019-09-08 12:26:58,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:26:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2019-09-08 12:26:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 805. [2019-09-08 12:26:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-09-08 12:26:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1020 transitions. [2019-09-08 12:26:58,959 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1020 transitions. Word has length 103 [2019-09-08 12:26:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:58,960 INFO L475 AbstractCegarLoop]: Abstraction has 805 states and 1020 transitions. [2019-09-08 12:26:58,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:26:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1020 transitions. [2019-09-08 12:26:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:26:58,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:58,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:58,961 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:58,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:58,961 INFO L82 PathProgramCache]: Analyzing trace with hash -272553273, now seen corresponding path program 1 times [2019-09-08 12:26:58,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:58,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:58,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:58,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:58,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:59,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:59,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:26:59,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:26:59,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:26:59,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:26:59,421 INFO L87 Difference]: Start difference. First operand 805 states and 1020 transitions. Second operand 12 states. [2019-09-08 12:26:59,883 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:27:00,305 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-08 12:27:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:02,250 INFO L93 Difference]: Finished difference Result 2435 states and 3342 transitions. [2019-09-08 12:27:02,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:27:02,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-09-08 12:27:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:02,253 INFO L225 Difference]: With dead ends: 2435 [2019-09-08 12:27:02,253 INFO L226 Difference]: Without dead ends: 2255 [2019-09-08 12:27:02,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:27:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2019-09-08 12:27:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 771. [2019-09-08 12:27:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-09-08 12:27:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 978 transitions. [2019-09-08 12:27:02,509 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 978 transitions. Word has length 104 [2019-09-08 12:27:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:02,509 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 978 transitions. [2019-09-08 12:27:02,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:27:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 978 transitions. [2019-09-08 12:27:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:27:02,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:02,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,511 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:02,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:02,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1720315989, now seen corresponding path program 1 times [2019-09-08 12:27:02,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:02,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:02,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:02,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:02,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:27:02,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:27:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:27:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:27:02,921 INFO L87 Difference]: Start difference. First operand 771 states and 978 transitions. Second operand 11 states. [2019-09-08 12:27:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:05,439 INFO L93 Difference]: Finished difference Result 2330 states and 3248 transitions. [2019-09-08 12:27:05,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:05,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-08 12:27:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:05,441 INFO L225 Difference]: With dead ends: 2330 [2019-09-08 12:27:05,442 INFO L226 Difference]: Without dead ends: 2158 [2019-09-08 12:27:05,442 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:27:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-09-08 12:27:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 729. [2019-09-08 12:27:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-09-08 12:27:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 921 transitions. [2019-09-08 12:27:05,667 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 921 transitions. Word has length 104 [2019-09-08 12:27:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:05,667 INFO L475 AbstractCegarLoop]: Abstraction has 729 states and 921 transitions. [2019-09-08 12:27:05,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:27:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 921 transitions. [2019-09-08 12:27:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:27:05,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:05,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,668 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 267466075, now seen corresponding path program 1 times [2019-09-08 12:27:05,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:05,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:05,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:05,871 INFO L134 CoverageAnalysis]: 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:05,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:05,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:27:05,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:27:05,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:27:05,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:27:05,872 INFO L87 Difference]: Start difference. First operand 729 states and 921 transitions. Second operand 9 states. [2019-09-08 12:27:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:08,003 INFO L93 Difference]: Finished difference Result 1532 states and 2058 transitions. [2019-09-08 12:27:08,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:27:08,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:27:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:08,005 INFO L225 Difference]: With dead ends: 1532 [2019-09-08 12:27:08,005 INFO L226 Difference]: Without dead ends: 1356 [2019-09-08 12:27:08,005 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:27:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-09-08 12:27:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 729. [2019-09-08 12:27:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-09-08 12:27:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 919 transitions. [2019-09-08 12:27:08,224 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 919 transitions. Word has length 104 [2019-09-08 12:27:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:08,224 INFO L475 AbstractCegarLoop]: Abstraction has 729 states and 919 transitions. [2019-09-08 12:27:08,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:27:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 919 transitions. [2019-09-08 12:27:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:27:08,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:08,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,226 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1850286100, now seen corresponding path program 1 times [2019-09-08 12:27:08,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:08,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:08,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:08,597 INFO L134 CoverageAnalysis]: 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:08,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:08,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:27:08,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:27:08,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:27:08,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:27:08,598 INFO L87 Difference]: Start difference. First operand 729 states and 919 transitions. Second operand 11 states. [2019-09-08 12:27:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:10,993 INFO L93 Difference]: Finished difference Result 2256 states and 3102 transitions. [2019-09-08 12:27:10,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:27:10,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-08 12:27:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:10,996 INFO L225 Difference]: With dead ends: 2256 [2019-09-08 12:27:10,996 INFO L226 Difference]: Without dead ends: 2044 [2019-09-08 12:27:10,996 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:27:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-09-08 12:27:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 663. [2019-09-08 12:27:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-08 12:27:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 836 transitions. [2019-09-08 12:27:11,212 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 836 transitions. Word has length 104 [2019-09-08 12:27:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:11,212 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 836 transitions. [2019-09-08 12:27:11,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:27:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 836 transitions. [2019-09-08 12:27:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:27:11,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:11,214 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,214 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1999000552, now seen corresponding path program 1 times [2019-09-08 12:27:11,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:11,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:11,316 ERROR L253 erpolLogProxyWrapper]: Interpolant 61 not inductive: (Check returned sat) [2019-09-08 12:27:11,339 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-08 12:27:11,344 INFO L168 Benchmark]: Toolchain (without parser) took 280624.79 ms. Allocated memory was 133.2 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 81.5 MB in the beginning and 224.1 MB in the end (delta: -142.6 MB). Peak memory consumption was 860.3 MB. Max. memory is 7.1 GB. [2019-09-08 12:27:11,345 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 133.2 MB. Free memory is still 107.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-08 12:27:11,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2267.11 ms. Allocated memory was 133.2 MB in the beginning and 221.2 MB in the end (delta: 88.1 MB). Free memory was 81.5 MB in the beginning and 104.6 MB in the end (delta: -23.1 MB). Peak memory consumption was 71.2 MB. Max. memory is 7.1 GB. [2019-09-08 12:27:11,346 INFO L168 Benchmark]: Boogie Preprocessor took 242.93 ms. Allocated memory is still 221.2 MB. Free memory was 104.6 MB in the beginning and 88.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-08 12:27:11,346 INFO L168 Benchmark]: RCFGBuilder took 3667.00 ms. Allocated memory was 221.2 MB in the beginning and 350.7 MB in the end (delta: 129.5 MB). Free memory was 88.9 MB in the beginning and 100.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2019-09-08 12:27:11,347 INFO L168 Benchmark]: TraceAbstraction took 274443.68 ms. Allocated memory was 350.7 MB in the beginning and 1.1 GB in the end (delta: 785.4 MB). Free memory was 100.6 MB in the beginning and 224.1 MB in the end (delta: -123.6 MB). Peak memory consumption was 661.8 MB. Max. memory is 7.1 GB. [2019-09-08 12:27:11,349 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 133.2 MB. Free memory is still 107.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2267.11 ms. Allocated memory was 133.2 MB in the beginning and 221.2 MB in the end (delta: 88.1 MB). Free memory was 81.5 MB in the beginning and 104.6 MB in the end (delta: -23.1 MB). Peak memory consumption was 71.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 242.93 ms. Allocated memory is still 221.2 MB. Free memory was 104.6 MB in the beginning and 88.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3667.00 ms. Allocated memory was 221.2 MB in the beginning and 350.7 MB in the end (delta: 129.5 MB). Free memory was 88.9 MB in the beginning and 100.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 274443.68 ms. Allocated memory was 350.7 MB in the beginning and 1.1 GB in the end (delta: 785.4 MB). Free memory was 100.6 MB in the beginning and 224.1 MB in the end (delta: -123.6 MB). Peak memory consumption was 661.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...