java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:43:41,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:43:41,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:43:41,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:43:41,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:43:41,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:43:41,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:43:41,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:43:41,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:43:41,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:43:41,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:43:41,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:43:41,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:43:41,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:43:41,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:43:41,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:43:41,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:43:41,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:43:41,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:43:41,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:43:41,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:43:41,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:43:41,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:43:41,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:43:41,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:43:41,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:43:41,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:43:41,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:43:41,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:43:41,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:43:41,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:43:41,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:43:41,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:43:41,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:43:41,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:43:41,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:43:41,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:43:41,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:43:41,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:43:41,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:43:41,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:43:41,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:43:41,240 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:43:41,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:43:41,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:43:41,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:43:41,242 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:43:41,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:43:41,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:43:41,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:43:41,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:43:41,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:43:41,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:43:41,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:43:41,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:43:41,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:43:41,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:43:41,244 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:43:41,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:43:41,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:43:41,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:43:41,245 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:43:41,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:43:41,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:43:41,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:43:41,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:43:41,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:43:41,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:43:41,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:43:41,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:43:41,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:43:41,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:43:41,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:43:41,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:43:41,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:43:41,311 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:43:41,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:43:41,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af332dd8/580c3cf54cfb45968943bb582d9562b1/FLAG65e624d3e [2019-09-08 10:43:42,242 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:43:42,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:43:42,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af332dd8/580c3cf54cfb45968943bb582d9562b1/FLAG65e624d3e [2019-09-08 10:43:42,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af332dd8/580c3cf54cfb45968943bb582d9562b1 [2019-09-08 10:43:42,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:43:42,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:43:42,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:43:42,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:43:42,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:43:42,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:43:42" (1/1) ... [2019-09-08 10:43:42,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6caf6d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:42, skipping insertion in model container [2019-09-08 10:43:42,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:43:42" (1/1) ... [2019-09-08 10:43:42,703 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:43:42,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:43:44,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:43:44,794 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:43:45,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:43:45,739 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:43:45,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45 WrapperNode [2019-09-08 10:43:45,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:43:45,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:43:45,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:43:45,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:43:45,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (1/1) ... [2019-09-08 10:43:45,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (1/1) ... [2019-09-08 10:43:45,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (1/1) ... [2019-09-08 10:43:45,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (1/1) ... [2019-09-08 10:43:45,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (1/1) ... [2019-09-08 10:43:46,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (1/1) ... [2019-09-08 10:43:46,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (1/1) ... [2019-09-08 10:43:46,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:43:46,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:43:46,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:43:46,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:43:46,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:43:46,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:43:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:43:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:43:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:43:46,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:43:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:43:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:43:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:43:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:43:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:43:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:43:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:43:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:43:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:43:46,254 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:43:46,254 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:43:46,256 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:43:46,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:43:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:43:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:43:54,557 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:43:54,558 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:43:54,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:43:54 BoogieIcfgContainer [2019-09-08 10:43:54,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:43:54,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:43:54,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:43:54,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:43:54,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:43:42" (1/3) ... [2019-09-08 10:43:54,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b024c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:43:54, skipping insertion in model container [2019-09-08 10:43:54,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:43:45" (2/3) ... [2019-09-08 10:43:54,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b024c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:43:54, skipping insertion in model container [2019-09-08 10:43:54,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:43:54" (3/3) ... [2019-09-08 10:43:54,578 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:43:54,588 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:43:54,610 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-08 10:43:54,627 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-08 10:43:54,682 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:43:54,683 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:43:54,683 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:43:54,684 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:43:54,684 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:43:54,684 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:43:54,684 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:43:54,684 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:43:54,684 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:43:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states. [2019-09-08 10:43:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:43:54,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:54,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:54,808 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1063639787, now seen corresponding path program 1 times [2019-09-08 10:43:54,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:54,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:54,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:43:55,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:55,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:43:55,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:43:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:43:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:43:55,640 INFO L87 Difference]: Start difference. First operand 3537 states. Second operand 5 states. [2019-09-08 10:44:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:01,100 INFO L93 Difference]: Finished difference Result 6657 states and 11852 transitions. [2019-09-08 10:44:01,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:44:01,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:44:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:01,166 INFO L225 Difference]: With dead ends: 6657 [2019-09-08 10:44:01,167 INFO L226 Difference]: Without dead ends: 4233 [2019-09-08 10:44:01,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:44:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-09-08 10:44:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4209. [2019-09-08 10:44:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4209 states. [2019-09-08 10:44:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4209 states to 4209 states and 5610 transitions. [2019-09-08 10:44:01,469 INFO L78 Accepts]: Start accepts. Automaton has 4209 states and 5610 transitions. Word has length 68 [2019-09-08 10:44:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:01,470 INFO L475 AbstractCegarLoop]: Abstraction has 4209 states and 5610 transitions. [2019-09-08 10:44:01,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:44:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4209 states and 5610 transitions. [2019-09-08 10:44:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:44:01,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:01,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:01,488 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1562022184, now seen corresponding path program 1 times [2019-09-08 10:44:01,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:01,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:01,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:01,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:01,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:01,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:01,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:44:01,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:44:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:44:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:44:01,866 INFO L87 Difference]: Start difference. First operand 4209 states and 5610 transitions. Second operand 6 states. [2019-09-08 10:44:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:05,554 INFO L93 Difference]: Finished difference Result 8614 states and 11587 transitions. [2019-09-08 10:44:05,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:44:05,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:44:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:05,583 INFO L225 Difference]: With dead ends: 8614 [2019-09-08 10:44:05,583 INFO L226 Difference]: Without dead ends: 6014 [2019-09-08 10:44:05,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:44:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2019-09-08 10:44:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 5973. [2019-09-08 10:44:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5973 states. [2019-09-08 10:44:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5973 states to 5973 states and 8078 transitions. [2019-09-08 10:44:05,858 INFO L78 Accepts]: Start accepts. Automaton has 5973 states and 8078 transitions. Word has length 69 [2019-09-08 10:44:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:05,859 INFO L475 AbstractCegarLoop]: Abstraction has 5973 states and 8078 transitions. [2019-09-08 10:44:05,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:44:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5973 states and 8078 transitions. [2019-09-08 10:44:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:44:05,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:05,873 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:05,874 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1710248159, now seen corresponding path program 1 times [2019-09-08 10:44:05,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:05,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:06,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:06,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:44:06,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:44:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:44:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:44:06,101 INFO L87 Difference]: Start difference. First operand 5973 states and 8078 transitions. Second operand 6 states. [2019-09-08 10:44:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:09,165 INFO L93 Difference]: Finished difference Result 13659 states and 18582 transitions. [2019-09-08 10:44:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:44:09,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:44:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:09,210 INFO L225 Difference]: With dead ends: 13659 [2019-09-08 10:44:09,210 INFO L226 Difference]: Without dead ends: 9019 [2019-09-08 10:44:09,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:44:09,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2019-09-08 10:44:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 8987. [2019-09-08 10:44:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8987 states. [2019-09-08 10:44:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8987 states to 8987 states and 12224 transitions. [2019-09-08 10:44:09,530 INFO L78 Accepts]: Start accepts. Automaton has 8987 states and 12224 transitions. Word has length 69 [2019-09-08 10:44:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:09,531 INFO L475 AbstractCegarLoop]: Abstraction has 8987 states and 12224 transitions. [2019-09-08 10:44:09,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:44:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8987 states and 12224 transitions. [2019-09-08 10:44:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:44:09,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:09,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:09,548 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:09,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:09,549 INFO L82 PathProgramCache]: Analyzing trace with hash -20519424, now seen corresponding path program 1 times [2019-09-08 10:44:09,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:09,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:09,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:09,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:09,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:09,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:09,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:44:09,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:44:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:44:09,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:44:09,878 INFO L87 Difference]: Start difference. First operand 8987 states and 12224 transitions. Second operand 8 states. [2019-09-08 10:44:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:15,170 INFO L93 Difference]: Finished difference Result 15466 states and 22327 transitions. [2019-09-08 10:44:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:44:15,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-09-08 10:44:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:15,224 INFO L225 Difference]: With dead ends: 15466 [2019-09-08 10:44:15,224 INFO L226 Difference]: Without dead ends: 13937 [2019-09-08 10:44:15,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:44:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2019-09-08 10:44:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 8881. [2019-09-08 10:44:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8881 states. [2019-09-08 10:44:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8881 states to 8881 states and 12073 transitions. [2019-09-08 10:44:15,568 INFO L78 Accepts]: Start accepts. Automaton has 8881 states and 12073 transitions. Word has length 70 [2019-09-08 10:44:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:15,568 INFO L475 AbstractCegarLoop]: Abstraction has 8881 states and 12073 transitions. [2019-09-08 10:44:15,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:44:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8881 states and 12073 transitions. [2019-09-08 10:44:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:44:15,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:15,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:15,581 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:15,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1266244003, now seen corresponding path program 1 times [2019-09-08 10:44:15,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:15,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:15,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:15,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:15,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:15,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:15,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:44:15,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:44:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:44:15,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:44:15,721 INFO L87 Difference]: Start difference. First operand 8881 states and 12073 transitions. Second operand 6 states. [2019-09-08 10:44:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:18,326 INFO L93 Difference]: Finished difference Result 20554 states and 28458 transitions. [2019-09-08 10:44:18,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:44:18,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:44:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:18,364 INFO L225 Difference]: With dead ends: 20554 [2019-09-08 10:44:18,364 INFO L226 Difference]: Without dead ends: 14486 [2019-09-08 10:44:18,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:44:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14486 states. [2019-09-08 10:44:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14486 to 14441. [2019-09-08 10:44:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14441 states. [2019-09-08 10:44:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14441 states to 14441 states and 20034 transitions. [2019-09-08 10:44:18,923 INFO L78 Accepts]: Start accepts. Automaton has 14441 states and 20034 transitions. Word has length 70 [2019-09-08 10:44:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:18,923 INFO L475 AbstractCegarLoop]: Abstraction has 14441 states and 20034 transitions. [2019-09-08 10:44:18,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:44:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 14441 states and 20034 transitions. [2019-09-08 10:44:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:44:18,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:18,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:18,936 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:18,937 INFO L82 PathProgramCache]: Analyzing trace with hash 451335994, now seen corresponding path program 1 times [2019-09-08 10:44:18,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:18,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:18,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:18,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:18,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:19,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:19,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:44:19,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:44:19,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:44:19,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:44:19,150 INFO L87 Difference]: Start difference. First operand 14441 states and 20034 transitions. Second operand 9 states. [2019-09-08 10:44:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:28,070 INFO L93 Difference]: Finished difference Result 44656 states and 65002 transitions. [2019-09-08 10:44:28,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:44:28,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 10:44:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:28,157 INFO L225 Difference]: With dead ends: 44656 [2019-09-08 10:44:28,157 INFO L226 Difference]: Without dead ends: 40572 [2019-09-08 10:44:28,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:44:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40572 states. [2019-09-08 10:44:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40572 to 14359. [2019-09-08 10:44:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14359 states. [2019-09-08 10:44:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14359 states to 14359 states and 19917 transitions. [2019-09-08 10:44:29,058 INFO L78 Accepts]: Start accepts. Automaton has 14359 states and 19917 transitions. Word has length 70 [2019-09-08 10:44:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:29,060 INFO L475 AbstractCegarLoop]: Abstraction has 14359 states and 19917 transitions. [2019-09-08 10:44:29,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:44:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 14359 states and 19917 transitions. [2019-09-08 10:44:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:44:29,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:29,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:29,074 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash 870882905, now seen corresponding path program 1 times [2019-09-08 10:44:29,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:29,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:29,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:29,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:29,669 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-09-08 10:44:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:29,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:29,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:44:29,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:44:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:44:29,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:44:29,727 INFO L87 Difference]: Start difference. First operand 14359 states and 19917 transitions. Second operand 12 states. [2019-09-08 10:44:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:37,284 INFO L93 Difference]: Finished difference Result 60981 states and 92101 transitions. [2019-09-08 10:44:37,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:44:37,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-08 10:44:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:37,413 INFO L225 Difference]: With dead ends: 60981 [2019-09-08 10:44:37,414 INFO L226 Difference]: Without dead ends: 56897 [2019-09-08 10:44:37,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:44:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56897 states. [2019-09-08 10:44:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56897 to 14273. [2019-09-08 10:44:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14273 states. [2019-09-08 10:44:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 19791 transitions. [2019-09-08 10:44:38,720 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 19791 transitions. Word has length 71 [2019-09-08 10:44:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:38,720 INFO L475 AbstractCegarLoop]: Abstraction has 14273 states and 19791 transitions. [2019-09-08 10:44:38,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:44:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 19791 transitions. [2019-09-08 10:44:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:44:38,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:38,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:38,731 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash 350453109, now seen corresponding path program 1 times [2019-09-08 10:44:38,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:38,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:38,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:38,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:38,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:39,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:39,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:44:39,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:44:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:44:39,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:44:39,032 INFO L87 Difference]: Start difference. First operand 14273 states and 19791 transitions. Second operand 9 states. [2019-09-08 10:44:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:45,166 INFO L93 Difference]: Finished difference Result 19659 states and 28084 transitions. [2019-09-08 10:44:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:44:45,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 10:44:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:45,195 INFO L225 Difference]: With dead ends: 19659 [2019-09-08 10:44:45,195 INFO L226 Difference]: Without dead ends: 19654 [2019-09-08 10:44:45,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:44:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2019-09-08 10:44:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 14273. [2019-09-08 10:44:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14273 states. [2019-09-08 10:44:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 19790 transitions. [2019-09-08 10:44:46,114 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 19790 transitions. Word has length 71 [2019-09-08 10:44:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:46,115 INFO L475 AbstractCegarLoop]: Abstraction has 14273 states and 19790 transitions. [2019-09-08 10:44:46,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:44:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 19790 transitions. [2019-09-08 10:44:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:44:46,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:46,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:46,125 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2100398418, now seen corresponding path program 1 times [2019-09-08 10:44:46,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:46,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:46,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:46,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:46,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:46,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:44:46,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:44:46,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:44:46,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:44:46,353 INFO L87 Difference]: Start difference. First operand 14273 states and 19790 transitions. Second operand 9 states. [2019-09-08 10:44:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:53,835 INFO L93 Difference]: Finished difference Result 22672 states and 32436 transitions. [2019-09-08 10:44:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:44:53,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 10:44:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:53,861 INFO L225 Difference]: With dead ends: 22672 [2019-09-08 10:44:53,862 INFO L226 Difference]: Without dead ends: 22664 [2019-09-08 10:44:53,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:44:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22664 states. [2019-09-08 10:44:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22664 to 14273. [2019-09-08 10:44:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14273 states. [2019-09-08 10:44:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 19789 transitions. [2019-09-08 10:44:54,689 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 19789 transitions. Word has length 71 [2019-09-08 10:44:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:54,689 INFO L475 AbstractCegarLoop]: Abstraction has 14273 states and 19789 transitions. [2019-09-08 10:44:54,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:44:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 19789 transitions. [2019-09-08 10:44:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:44:54,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:54,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] [2019-09-08 10:44:54,696 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash 343354784, now seen corresponding path program 1 times [2019-09-08 10:44:54,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:54,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:54,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:54,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:55,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:55,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:44:55,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:44:55,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:44:55,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:44:55,232 INFO L87 Difference]: Start difference. First operand 14273 states and 19789 transitions. Second operand 11 states. [2019-09-08 10:44:55,786 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 10:45:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:13,344 INFO L93 Difference]: Finished difference Result 101123 states and 154263 transitions. [2019-09-08 10:45:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 10:45:13,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-09-08 10:45:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:13,450 INFO L225 Difference]: With dead ends: 101123 [2019-09-08 10:45:13,451 INFO L226 Difference]: Without dead ends: 97036 [2019-09-08 10:45:13,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=538, Invalid=1624, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 10:45:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97036 states. [2019-09-08 10:45:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97036 to 14184. [2019-09-08 10:45:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14184 states. [2019-09-08 10:45:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14184 states to 14184 states and 19666 transitions. [2019-09-08 10:45:15,275 INFO L78 Accepts]: Start accepts. Automaton has 14184 states and 19666 transitions. Word has length 71 [2019-09-08 10:45:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:15,276 INFO L475 AbstractCegarLoop]: Abstraction has 14184 states and 19666 transitions. [2019-09-08 10:45:15,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:45:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 14184 states and 19666 transitions. [2019-09-08 10:45:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:45:15,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:15,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] [2019-09-08 10:45:15,283 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1658925808, now seen corresponding path program 1 times [2019-09-08 10:45:15,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:15,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:15,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:15,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:15,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:15,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:15,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:45:15,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:45:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:45:15,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:45:15,767 INFO L87 Difference]: Start difference. First operand 14184 states and 19666 transitions. Second operand 12 states. [2019-09-08 10:45:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:28,473 INFO L93 Difference]: Finished difference Result 56846 states and 85701 transitions. [2019-09-08 10:45:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:45:28,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-08 10:45:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:28,532 INFO L225 Difference]: With dead ends: 56846 [2019-09-08 10:45:28,532 INFO L226 Difference]: Without dead ends: 56838 [2019-09-08 10:45:28,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:45:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56838 states. [2019-09-08 10:45:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56838 to 14176. [2019-09-08 10:45:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14176 states. [2019-09-08 10:45:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 19657 transitions. [2019-09-08 10:45:31,349 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 19657 transitions. Word has length 72 [2019-09-08 10:45:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:31,349 INFO L475 AbstractCegarLoop]: Abstraction has 14176 states and 19657 transitions. [2019-09-08 10:45:31,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:45:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 19657 transitions. [2019-09-08 10:45:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:45:31,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:31,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:45:31,359 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:31,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1364499548, now seen corresponding path program 1 times [2019-09-08 10:45:31,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:31,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:31,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:31,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:31,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:31,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:31,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:45:31,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:45:31,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:45:31,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:45:31,530 INFO L87 Difference]: Start difference. First operand 14176 states and 19657 transitions. Second operand 9 states. [2019-09-08 10:45:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:43,462 INFO L93 Difference]: Finished difference Result 44447 states and 64708 transitions. [2019-09-08 10:45:43,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:45:43,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 10:45:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:43,506 INFO L225 Difference]: With dead ends: 44447 [2019-09-08 10:45:43,507 INFO L226 Difference]: Without dead ends: 40351 [2019-09-08 10:45:43,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:45:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-08 10:45:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 14176. [2019-09-08 10:45:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14176 states. [2019-09-08 10:45:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 19656 transitions. [2019-09-08 10:45:45,127 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 19656 transitions. Word has length 72 [2019-09-08 10:45:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:45,128 INFO L475 AbstractCegarLoop]: Abstraction has 14176 states and 19656 transitions. [2019-09-08 10:45:45,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:45:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 19656 transitions. [2019-09-08 10:45:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:45:45,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:45,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] [2019-09-08 10:45:45,135 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash -313639877, now seen corresponding path program 1 times [2019-09-08 10:45:45,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:45,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:45,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:45,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:45,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:45:45,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:45:45,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:45:45,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:45:45,323 INFO L87 Difference]: Start difference. First operand 14176 states and 19656 transitions. Second operand 9 states. [2019-09-08 10:45:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:56,868 INFO L93 Difference]: Finished difference Result 35921 states and 53004 transitions. [2019-09-08 10:45:56,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:45:56,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 10:45:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:56,901 INFO L225 Difference]: With dead ends: 35921 [2019-09-08 10:45:56,901 INFO L226 Difference]: Without dead ends: 31900 [2019-09-08 10:45:56,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:45:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31900 states. [2019-09-08 10:45:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31900 to 14176. [2019-09-08 10:45:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14176 states. [2019-09-08 10:45:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 19655 transitions. [2019-09-08 10:45:58,332 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 19655 transitions. Word has length 72 [2019-09-08 10:45:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:58,332 INFO L475 AbstractCegarLoop]: Abstraction has 14176 states and 19655 transitions. [2019-09-08 10:45:58,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:45:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 19655 transitions. [2019-09-08 10:45:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:45:58,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:58,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:45:58,340 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1017120245, now seen corresponding path program 1 times [2019-09-08 10:45:58,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:58,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:58,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:58,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:58,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:45:58,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:45:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:45:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:45:58,657 INFO L87 Difference]: Start difference. First operand 14176 states and 19655 transitions. Second operand 8 states. [2019-09-08 10:46:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:08,400 INFO L93 Difference]: Finished difference Result 38662 states and 57575 transitions. [2019-09-08 10:46:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:46:08,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-08 10:46:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:08,433 INFO L225 Difference]: With dead ends: 38662 [2019-09-08 10:46:08,434 INFO L226 Difference]: Without dead ends: 33939 [2019-09-08 10:46:08,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:46:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33939 states. [2019-09-08 10:46:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33939 to 14176. [2019-09-08 10:46:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14176 states. [2019-09-08 10:46:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 19654 transitions. [2019-09-08 10:46:09,944 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 19654 transitions. Word has length 72 [2019-09-08 10:46:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:09,944 INFO L475 AbstractCegarLoop]: Abstraction has 14176 states and 19654 transitions. [2019-09-08 10:46:09,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:46:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 19654 transitions. [2019-09-08 10:46:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:46:09,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:09,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:46:09,953 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash 98934365, now seen corresponding path program 1 times [2019-09-08 10:46:09,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:09,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:09,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:10,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:10,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:46:10,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:46:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:46:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:46:10,370 INFO L87 Difference]: Start difference. First operand 14176 states and 19654 transitions. Second operand 11 states. [2019-09-08 10:46:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:27,298 INFO L93 Difference]: Finished difference Result 66608 states and 100941 transitions. [2019-09-08 10:46:27,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:46:27,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-08 10:46:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:27,358 INFO L225 Difference]: With dead ends: 66608 [2019-09-08 10:46:27,359 INFO L226 Difference]: Without dead ends: 62418 [2019-09-08 10:46:27,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2019-09-08 10:46:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62418 states. [2019-09-08 10:46:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62418 to 14133. [2019-09-08 10:46:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14133 states. [2019-09-08 10:46:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14133 states to 14133 states and 19603 transitions. [2019-09-08 10:46:29,094 INFO L78 Accepts]: Start accepts. Automaton has 14133 states and 19603 transitions. Word has length 72 [2019-09-08 10:46:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:29,094 INFO L475 AbstractCegarLoop]: Abstraction has 14133 states and 19603 transitions. [2019-09-08 10:46:29,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:46:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 14133 states and 19603 transitions. [2019-09-08 10:46:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:46:29,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:29,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:46:29,101 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:29,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash 997156317, now seen corresponding path program 1 times [2019-09-08 10:46:29,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:29,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:29,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:29,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:46:29,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:46:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:46:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:29,193 INFO L87 Difference]: Start difference. First operand 14133 states and 19603 transitions. Second operand 3 states. [2019-09-08 10:46:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:31,363 INFO L93 Difference]: Finished difference Result 22050 states and 31602 transitions. [2019-09-08 10:46:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:46:31,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 10:46:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:31,375 INFO L225 Difference]: With dead ends: 22050 [2019-09-08 10:46:31,375 INFO L226 Difference]: Without dead ends: 13403 [2019-09-08 10:46:31,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13403 states. [2019-09-08 10:46:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13403 to 13385. [2019-09-08 10:46:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13385 states. [2019-09-08 10:46:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13385 states to 13385 states and 19122 transitions. [2019-09-08 10:46:33,470 INFO L78 Accepts]: Start accepts. Automaton has 13385 states and 19122 transitions. Word has length 72 [2019-09-08 10:46:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:33,470 INFO L475 AbstractCegarLoop]: Abstraction has 13385 states and 19122 transitions. [2019-09-08 10:46:33,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:46:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 13385 states and 19122 transitions. [2019-09-08 10:46:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:46:33,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:33,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:46:33,476 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2144380542, now seen corresponding path program 1 times [2019-09-08 10:46:33,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:33,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:33,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:33,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:33,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:46:33,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:46:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:46:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:33,574 INFO L87 Difference]: Start difference. First operand 13385 states and 19122 transitions. Second operand 3 states. [2019-09-08 10:46:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:37,431 INFO L93 Difference]: Finished difference Result 28842 states and 42317 transitions. [2019-09-08 10:46:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:46:37,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:46:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:37,451 INFO L225 Difference]: With dead ends: 28842 [2019-09-08 10:46:37,451 INFO L226 Difference]: Without dead ends: 21011 [2019-09-08 10:46:37,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21011 states. [2019-09-08 10:46:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21011 to 18868. [2019-09-08 10:46:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18868 states. [2019-09-08 10:46:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18868 states to 18868 states and 26978 transitions. [2019-09-08 10:46:40,912 INFO L78 Accepts]: Start accepts. Automaton has 18868 states and 26978 transitions. Word has length 73 [2019-09-08 10:46:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:40,912 INFO L475 AbstractCegarLoop]: Abstraction has 18868 states and 26978 transitions. [2019-09-08 10:46:40,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:46:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 18868 states and 26978 transitions. [2019-09-08 10:46:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:46:40,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:40,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:46:40,919 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1936130210, now seen corresponding path program 1 times [2019-09-08 10:46:40,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:40,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:40,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:40,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:41,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:41,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:46:41,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:46:41,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:46:41,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:41,016 INFO L87 Difference]: Start difference. First operand 18868 states and 26978 transitions. Second operand 3 states. [2019-09-08 10:46:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:47,223 INFO L93 Difference]: Finished difference Result 38220 states and 56784 transitions. [2019-09-08 10:46:47,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:46:47,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:46:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:47,250 INFO L225 Difference]: With dead ends: 38220 [2019-09-08 10:46:47,251 INFO L226 Difference]: Without dead ends: 26635 [2019-09-08 10:46:47,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26635 states. [2019-09-08 10:46:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26635 to 20603. [2019-09-08 10:46:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20603 states. [2019-09-08 10:46:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20603 states to 20603 states and 29770 transitions. [2019-09-08 10:46:51,928 INFO L78 Accepts]: Start accepts. Automaton has 20603 states and 29770 transitions. Word has length 73 [2019-09-08 10:46:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:51,928 INFO L475 AbstractCegarLoop]: Abstraction has 20603 states and 29770 transitions. [2019-09-08 10:46:51,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:46:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 20603 states and 29770 transitions. [2019-09-08 10:46:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:46:51,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:51,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:46:51,934 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2045368516, now seen corresponding path program 1 times [2019-09-08 10:46:51,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:51,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:52,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:52,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:46:52,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:46:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:46:52,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:52,035 INFO L87 Difference]: Start difference. First operand 20603 states and 29770 transitions. Second operand 3 states. [2019-09-08 10:47:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:00,819 INFO L93 Difference]: Finished difference Result 50005 states and 73418 transitions. [2019-09-08 10:47:00,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:47:00,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:47:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:00,851 INFO L225 Difference]: With dead ends: 50005 [2019-09-08 10:47:00,852 INFO L226 Difference]: Without dead ends: 33804 [2019-09-08 10:47:00,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33804 states. [2019-09-08 10:47:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33804 to 33796. [2019-09-08 10:47:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33796 states. [2019-09-08 10:47:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33796 states to 33796 states and 48558 transitions. [2019-09-08 10:47:09,257 INFO L78 Accepts]: Start accepts. Automaton has 33796 states and 48558 transitions. Word has length 73 [2019-09-08 10:47:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:09,257 INFO L475 AbstractCegarLoop]: Abstraction has 33796 states and 48558 transitions. [2019-09-08 10:47:09,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:47:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33796 states and 48558 transitions. [2019-09-08 10:47:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:47:09,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:09,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:09,264 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:09,264 INFO L82 PathProgramCache]: Analyzing trace with hash 466736798, now seen corresponding path program 1 times [2019-09-08 10:47:09,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:09,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:09,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:09,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:09,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:09,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:09,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:47:09,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:47:09,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:47:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:09,342 INFO L87 Difference]: Start difference. First operand 33796 states and 48558 transitions. Second operand 3 states. [2019-09-08 10:47:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:24,092 INFO L93 Difference]: Finished difference Result 75796 states and 111456 transitions. [2019-09-08 10:47:24,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:47:24,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:47:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:24,143 INFO L225 Difference]: With dead ends: 75796 [2019-09-08 10:47:24,143 INFO L226 Difference]: Without dead ends: 46579 [2019-09-08 10:47:24,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46579 states. [2019-09-08 10:47:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46579 to 46571. [2019-09-08 10:47:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46571 states. [2019-09-08 10:47:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46571 states to 46571 states and 68312 transitions. [2019-09-08 10:47:37,180 INFO L78 Accepts]: Start accepts. Automaton has 46571 states and 68312 transitions. Word has length 73 [2019-09-08 10:47:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:37,181 INFO L475 AbstractCegarLoop]: Abstraction has 46571 states and 68312 transitions. [2019-09-08 10:47:37,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:47:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 46571 states and 68312 transitions. [2019-09-08 10:47:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:47:37,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:37,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:37,187 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1267420457, now seen corresponding path program 1 times [2019-09-08 10:47:37,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:37,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:37,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:37,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:37,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:47:37,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:47:37,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:47:37,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:37,278 INFO L87 Difference]: Start difference. First operand 46571 states and 68312 transitions. Second operand 3 states. [2019-09-08 10:47:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:54,724 INFO L93 Difference]: Finished difference Result 98588 states and 145740 transitions. [2019-09-08 10:47:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:47:54,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:47:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:54,789 INFO L225 Difference]: With dead ends: 98588 [2019-09-08 10:47:54,789 INFO L226 Difference]: Without dead ends: 53878 [2019-09-08 10:47:54,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53878 states. [2019-09-08 10:48:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53878 to 43486. [2019-09-08 10:48:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43486 states. [2019-09-08 10:48:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43486 states to 43486 states and 64192 transitions. [2019-09-08 10:48:07,842 INFO L78 Accepts]: Start accepts. Automaton has 43486 states and 64192 transitions. Word has length 74 [2019-09-08 10:48:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:07,842 INFO L475 AbstractCegarLoop]: Abstraction has 43486 states and 64192 transitions. [2019-09-08 10:48:07,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 43486 states and 64192 transitions. [2019-09-08 10:48:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:48:07,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:07,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:07,846 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash -993095660, now seen corresponding path program 1 times [2019-09-08 10:48:07,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:07,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:07,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:07,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:07,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:07,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:07,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:07,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:07,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:07,931 INFO L87 Difference]: Start difference. First operand 43486 states and 64192 transitions. Second operand 3 states. [2019-09-08 10:48:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:32,057 INFO L93 Difference]: Finished difference Result 115037 states and 171610 transitions. [2019-09-08 10:48:32,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:32,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:48:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:32,137 INFO L225 Difference]: With dead ends: 115037 [2019-09-08 10:48:32,137 INFO L226 Difference]: Without dead ends: 72833 [2019-09-08 10:48:32,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72833 states. [2019-09-08 10:48:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72833 to 56437. [2019-09-08 10:48:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-08 10:48:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84111 transitions. [2019-09-08 10:48:49,548 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84111 transitions. Word has length 74 [2019-09-08 10:48:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:49,549 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84111 transitions. [2019-09-08 10:48:49,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84111 transitions. [2019-09-08 10:48:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:48:49,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:49,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:49,552 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1708157951, now seen corresponding path program 1 times [2019-09-08 10:48:49,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:49,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:49,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:49,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:49,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:48:49,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:48:49,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:48:49,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:48:49,731 INFO L87 Difference]: Start difference. First operand 56437 states and 84111 transitions. Second operand 9 states. [2019-09-08 10:49:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:37,222 INFO L93 Difference]: Finished difference Result 136685 states and 203850 transitions. [2019-09-08 10:49:37,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:49:37,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:49:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:37,370 INFO L225 Difference]: With dead ends: 136685 [2019-09-08 10:49:37,370 INFO L226 Difference]: Without dead ends: 134203 [2019-09-08 10:49:37,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:49:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134203 states. [2019-09-08 10:49:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134203 to 56437. [2019-09-08 10:49:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-08 10:49:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84109 transitions. [2019-09-08 10:49:55,862 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84109 transitions. Word has length 75 [2019-09-08 10:49:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:55,862 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84109 transitions. [2019-09-08 10:49:55,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:49:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84109 transitions. [2019-09-08 10:49:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:49:55,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:55,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:55,866 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash -592179090, now seen corresponding path program 1 times [2019-09-08 10:49:55,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:55,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:55,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:55,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:55,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:56,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:56,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:49:56,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:49:56,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:49:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:49:56,034 INFO L87 Difference]: Start difference. First operand 56437 states and 84109 transitions. Second operand 9 states. [2019-09-08 10:50:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:34,131 INFO L93 Difference]: Finished difference Result 103646 states and 154099 transitions. [2019-09-08 10:50:34,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:50:34,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:50:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:34,249 INFO L225 Difference]: With dead ends: 103646 [2019-09-08 10:50:34,249 INFO L226 Difference]: Without dead ends: 101126 [2019-09-08 10:50:34,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:50:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101126 states. [2019-09-08 10:50:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101126 to 56437. [2019-09-08 10:50:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-08 10:50:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84107 transitions. [2019-09-08 10:50:52,591 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84107 transitions. Word has length 75 [2019-09-08 10:50:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:52,591 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84107 transitions. [2019-09-08 10:50:52,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:50:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84107 transitions. [2019-09-08 10:50:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:50:52,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:52,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:50:52,595 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash 129580343, now seen corresponding path program 1 times [2019-09-08 10:50:52,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:52,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:52,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:52,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:52,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:50:52,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:50:52,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:50:52,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:50:52,756 INFO L87 Difference]: Start difference. First operand 56437 states and 84107 transitions. Second operand 9 states. [2019-09-08 10:51:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:52,899 INFO L93 Difference]: Finished difference Result 164930 states and 244277 transitions. [2019-09-08 10:51:52,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:51:52,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:51:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:53,090 INFO L225 Difference]: With dead ends: 164930 [2019-09-08 10:51:53,090 INFO L226 Difference]: Without dead ends: 162220 [2019-09-08 10:51:53,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:51:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162220 states. [2019-09-08 10:52:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162220 to 56437. [2019-09-08 10:52:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-08 10:52:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84105 transitions. [2019-09-08 10:52:11,403 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84105 transitions. Word has length 75 [2019-09-08 10:52:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:11,403 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84105 transitions. [2019-09-08 10:52:11,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:52:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84105 transitions. [2019-09-08 10:52:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:52:11,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:11,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:52:11,406 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:11,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:11,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1422892121, now seen corresponding path program 1 times [2019-09-08 10:52:11,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:11,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:11,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:11,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:11,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:52:11,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:52:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:52:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:52:11,579 INFO L87 Difference]: Start difference. First operand 56437 states and 84105 transitions. Second operand 9 states. [2019-09-08 10:52:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:50,120 INFO L93 Difference]: Finished difference Result 103583 states and 154023 transitions. [2019-09-08 10:52:50,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:52:50,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:52:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:50,237 INFO L225 Difference]: With dead ends: 103583 [2019-09-08 10:52:50,237 INFO L226 Difference]: Without dead ends: 101101 [2019-09-08 10:52:50,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:52:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101101 states. [2019-09-08 10:53:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101101 to 56437. [2019-09-08 10:53:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-08 10:53:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84103 transitions. [2019-09-08 10:53:08,726 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84103 transitions. Word has length 75 [2019-09-08 10:53:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:08,727 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84103 transitions. [2019-09-08 10:53:08,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:53:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84103 transitions. [2019-09-08 10:53:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:53:08,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:08,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:53:08,732 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1817625223, now seen corresponding path program 1 times [2019-09-08 10:53:08,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:08,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:08,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:08,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:08,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:53:08,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:53:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:53:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:53:08,895 INFO L87 Difference]: Start difference. First operand 56437 states and 84103 transitions. Second operand 9 states. [2019-09-08 10:53:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:47,784 INFO L93 Difference]: Finished difference Result 103583 states and 154021 transitions. [2019-09-08 10:53:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:53:47,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:53:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:47,896 INFO L225 Difference]: With dead ends: 103583 [2019-09-08 10:53:47,896 INFO L226 Difference]: Without dead ends: 101101 [2019-09-08 10:53:47,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:53:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101101 states. [2019-09-08 10:54:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101101 to 56437. [2019-09-08 10:54:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-08 10:54:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84101 transitions. [2019-09-08 10:54:06,481 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84101 transitions. Word has length 75 [2019-09-08 10:54:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:06,481 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84101 transitions. [2019-09-08 10:54:06,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:54:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84101 transitions. [2019-09-08 10:54:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:54:06,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:06,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:54:06,484 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash -182574823, now seen corresponding path program 1 times [2019-09-08 10:54:06,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:06,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:06,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:06,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:06,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:06,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:54:06,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:54:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:54:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:54:06,643 INFO L87 Difference]: Start difference. First operand 56437 states and 84101 transitions. Second operand 9 states. [2019-09-08 10:54:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:45,377 INFO L93 Difference]: Finished difference Result 103646 states and 154091 transitions. [2019-09-08 10:54:45,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:54:45,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:54:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:45,510 INFO L225 Difference]: With dead ends: 103646 [2019-09-08 10:54:45,510 INFO L226 Difference]: Without dead ends: 101126 [2019-09-08 10:54:45,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:54:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101126 states. [2019-09-08 10:55:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101126 to 56437. [2019-09-08 10:55:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56437 states. [2019-09-08 10:55:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56437 states to 56437 states and 84099 transitions. [2019-09-08 10:55:05,883 INFO L78 Accepts]: Start accepts. Automaton has 56437 states and 84099 transitions. Word has length 75 [2019-09-08 10:55:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:05,883 INFO L475 AbstractCegarLoop]: Abstraction has 56437 states and 84099 transitions. [2019-09-08 10:55:05,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:55:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 56437 states and 84099 transitions. [2019-09-08 10:55:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:55:05,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:05,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:05,887 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1398382405, now seen corresponding path program 1 times [2019-09-08 10:55:05,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:05,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:05,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:05,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:05,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:05,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:05,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:05,981 INFO L87 Difference]: Start difference. First operand 56437 states and 84099 transitions. Second operand 3 states. [2019-09-08 10:55:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:40,642 INFO L93 Difference]: Finished difference Result 155875 states and 233792 transitions. [2019-09-08 10:55:40,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:55:40,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:55:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:40,782 INFO L225 Difference]: With dead ends: 155875 [2019-09-08 10:55:40,782 INFO L226 Difference]: Without dead ends: 101987 [2019-09-08 10:55:40,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101987 states. [2019-09-08 10:56:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101987 to 70667. [2019-09-08 10:56:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70667 states. [2019-09-08 10:56:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70667 states to 70667 states and 104396 transitions. [2019-09-08 10:56:09,950 INFO L78 Accepts]: Start accepts. Automaton has 70667 states and 104396 transitions. Word has length 76 [2019-09-08 10:56:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:09,950 INFO L475 AbstractCegarLoop]: Abstraction has 70667 states and 104396 transitions. [2019-09-08 10:56:09,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:56:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 70667 states and 104396 transitions. [2019-09-08 10:56:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:56:09,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:09,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:56:09,953 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash 589063280, now seen corresponding path program 1 times [2019-09-08 10:56:09,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:09,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:56:10,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:10,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:56:10,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:56:10,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:56:10,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:56:10,121 INFO L87 Difference]: Start difference. First operand 70667 states and 104396 transitions. Second operand 9 states. [2019-09-08 10:57:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:04,977 INFO L93 Difference]: Finished difference Result 125347 states and 184629 transitions. [2019-09-08 10:57:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:57:04,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-08 10:57:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:05,127 INFO L225 Difference]: With dead ends: 125347 [2019-09-08 10:57:05,127 INFO L226 Difference]: Without dead ends: 124388 [2019-09-08 10:57:05,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:57:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124388 states.