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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:09:02,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:09:02,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:09:02,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:09:02,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:09:02,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:09:02,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:09:02,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:09:02,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:09:02,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:09:02,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:09:02,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:09:02,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:09:02,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:09:02,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:09:02,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:09:02,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:09:02,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:09:02,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:09:02,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:09:02,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:09:02,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:09:02,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:09:02,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:09:02,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:09:02,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:09:02,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:09:02,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:09:02,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:09:02,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:09:02,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:09:02,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:09:02,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:09:02,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:09:02,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:09:02,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:09:02,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:09:02,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:09:02,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:09:02,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:09:02,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:09:02,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:09:02,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:09:02,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:09:02,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:09:02,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:09:02,510 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:09:02,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:09:02,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:09:02,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:09:02,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:09:02,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:09:02,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:09:02,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:09:02,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:09:02,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:09:02,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:09:02,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:09:02,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:09:02,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:09:02,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:09:02,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:09:02,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:09:02,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:09:02,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:09:02,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:09:02,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:09:02,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:09:02,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:09:02,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:09:02,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:09:02,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:09:02,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:09:02,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:09:02,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:09:02,559 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:09:02,560 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 12:09:02,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12e4a7eb3/4d8024fc2e95498a95c7fda8e03dac5f/FLAGc8b64bc53 [2019-09-08 12:09:03,286 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:09:03,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 12:09:03,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12e4a7eb3/4d8024fc2e95498a95c7fda8e03dac5f/FLAGc8b64bc53 [2019-09-08 12:09:03,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12e4a7eb3/4d8024fc2e95498a95c7fda8e03dac5f [2019-09-08 12:09:03,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:09:03,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:09:03,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:09:03,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:09:03,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:09:03,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:09:03" (1/1) ... [2019-09-08 12:09:03,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2af753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:03, skipping insertion in model container [2019-09-08 12:09:03,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:09:03" (1/1) ... [2019-09-08 12:09:03,449 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:09:03,574 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:09:04,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:09:04,541 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:09:04,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:09:04,969 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:09:04,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04 WrapperNode [2019-09-08 12:09:04,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:09:04,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:09:04,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:09:04,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:09:04,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (1/1) ... [2019-09-08 12:09:04,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (1/1) ... [2019-09-08 12:09:05,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (1/1) ... [2019-09-08 12:09:05,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (1/1) ... [2019-09-08 12:09:05,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (1/1) ... [2019-09-08 12:09:05,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (1/1) ... [2019-09-08 12:09:05,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (1/1) ... [2019-09-08 12:09:05,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:09:05,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:09:05,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:09:05,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:09:05,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:09:05,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:09:05,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:09:05,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:09:05,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:09:05,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:09:05,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:09:05,218 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:09:05,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:09:05,218 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:09:05,219 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:09:05,219 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:09:05,219 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:09:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:09:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:09:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:09:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:09:05,223 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:09:05,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:09:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:09:05,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:09:07,459 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:09:07,460 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:09:07,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:09:07 BoogieIcfgContainer [2019-09-08 12:09:07,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:09:07,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:09:07,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:09:07,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:09:07,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:09:03" (1/3) ... [2019-09-08 12:09:07,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d7643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:09:07, skipping insertion in model container [2019-09-08 12:09:07,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:09:04" (2/3) ... [2019-09-08 12:09:07,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d7643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:09:07, skipping insertion in model container [2019-09-08 12:09:07,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:09:07" (3/3) ... [2019-09-08 12:09:07,472 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 12:09:07,483 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:09:07,509 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 12:09:07,530 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 12:09:07,577 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:09:07,578 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:09:07,578 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:09:07,578 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:09:07,578 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:09:07,578 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:09:07,578 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:09:07,578 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:09:07,579 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:09:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states. [2019-09-08 12:09:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:09:07,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:07,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:07,640 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 446132065, now seen corresponding path program 1 times [2019-09-08 12:09:07,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:07,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:07,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:07,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:07,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:08,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:08,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:08,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:08,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:08,204 INFO L87 Difference]: Start difference. First operand 634 states. Second operand 5 states. [2019-09-08 12:09:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:08,962 INFO L93 Difference]: Finished difference Result 984 states and 1700 transitions. [2019-09-08 12:09:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:08,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:09:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:08,982 INFO L225 Difference]: With dead ends: 984 [2019-09-08 12:09:08,982 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 12:09:08,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 12:09:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-08 12:09:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:09:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 638 transitions. [2019-09-08 12:09:09,113 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 638 transitions. Word has length 76 [2019-09-08 12:09:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:09,114 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 638 transitions. [2019-09-08 12:09:09,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 638 transitions. [2019-09-08 12:09:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:09:09,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:09,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, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:09,126 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:09,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1643184449, now seen corresponding path program 1 times [2019-09-08 12:09:09,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:09,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:09,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:09,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:09,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:09,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:09,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:09,391 INFO L87 Difference]: Start difference. First operand 505 states and 638 transitions. Second operand 5 states. [2019-09-08 12:09:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:09,761 INFO L93 Difference]: Finished difference Result 843 states and 1094 transitions. [2019-09-08 12:09:09,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:09,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:09:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:09,770 INFO L225 Difference]: With dead ends: 843 [2019-09-08 12:09:09,770 INFO L226 Difference]: Without dead ends: 444 [2019-09-08 12:09:09,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-08 12:09:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2019-09-08 12:09:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-09-08 12:09:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 568 transitions. [2019-09-08 12:09:09,808 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 568 transitions. Word has length 77 [2019-09-08 12:09:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:09,809 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 568 transitions. [2019-09-08 12:09:09,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 568 transitions. [2019-09-08 12:09:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:09:09,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:09,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:09,812 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash -98932957, now seen corresponding path program 1 times [2019-09-08 12:09:09,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:09,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:09,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:10,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:10,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:10,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:10,044 INFO L87 Difference]: Start difference. First operand 444 states and 568 transitions. Second operand 5 states. [2019-09-08 12:09:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:10,446 INFO L93 Difference]: Finished difference Result 782 states and 1023 transitions. [2019-09-08 12:09:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:10,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 12:09:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:10,450 INFO L225 Difference]: With dead ends: 782 [2019-09-08 12:09:10,450 INFO L226 Difference]: Without dead ends: 418 [2019-09-08 12:09:10,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-08 12:09:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2019-09-08 12:09:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-08 12:09:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 537 transitions. [2019-09-08 12:09:10,470 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 537 transitions. Word has length 78 [2019-09-08 12:09:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:10,471 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 537 transitions. [2019-09-08 12:09:10,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 537 transitions. [2019-09-08 12:09:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:09:10,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:10,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:10,474 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1520302037, now seen corresponding path program 1 times [2019-09-08 12:09:10,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:10,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:10,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:10,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:10,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:10,634 INFO L87 Difference]: Start difference. First operand 418 states and 537 transitions. Second operand 5 states. [2019-09-08 12:09:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:11,062 INFO L93 Difference]: Finished difference Result 756 states and 991 transitions. [2019-09-08 12:09:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:11,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-08 12:09:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:11,066 INFO L225 Difference]: With dead ends: 756 [2019-09-08 12:09:11,066 INFO L226 Difference]: Without dead ends: 408 [2019-09-08 12:09:11,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-08 12:09:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-09-08 12:09:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-08 12:09:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 524 transitions. [2019-09-08 12:09:11,091 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 524 transitions. Word has length 79 [2019-09-08 12:09:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:11,093 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 524 transitions. [2019-09-08 12:09:11,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 524 transitions. [2019-09-08 12:09:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:09:11,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:11,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:11,097 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1777858629, now seen corresponding path program 1 times [2019-09-08 12:09:11,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:11,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:11,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:11,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:11,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:11,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:11,240 INFO L87 Difference]: Start difference. First operand 408 states and 524 transitions. Second operand 5 states. [2019-09-08 12:09:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:11,625 INFO L93 Difference]: Finished difference Result 746 states and 977 transitions. [2019-09-08 12:09:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:11,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 12:09:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:11,628 INFO L225 Difference]: With dead ends: 746 [2019-09-08 12:09:11,628 INFO L226 Difference]: Without dead ends: 397 [2019-09-08 12:09:11,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:09:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-09-08 12:09:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-09-08 12:09:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 511 transitions. [2019-09-08 12:09:11,653 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 511 transitions. Word has length 80 [2019-09-08 12:09:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:11,653 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 511 transitions. [2019-09-08 12:09:11,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 511 transitions. [2019-09-08 12:09:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:09:11,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:11,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:11,656 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1690487197, now seen corresponding path program 1 times [2019-09-08 12:09:11,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:11,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:11,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:11,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:11,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:11,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:11,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:11,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:11,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:11,912 INFO L87 Difference]: Start difference. First operand 397 states and 511 transitions. Second operand 9 states. [2019-09-08 12:09:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:13,169 INFO L93 Difference]: Finished difference Result 831 states and 1111 transitions. [2019-09-08 12:09:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:13,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:09:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:13,176 INFO L225 Difference]: With dead ends: 831 [2019-09-08 12:09:13,177 INFO L226 Difference]: Without dead ends: 741 [2019-09-08 12:09:13,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-08 12:09:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 397. [2019-09-08 12:09:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 510 transitions. [2019-09-08 12:09:13,212 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 510 transitions. Word has length 81 [2019-09-08 12:09:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:13,217 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 510 transitions. [2019-09-08 12:09:13,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 510 transitions. [2019-09-08 12:09:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:09:13,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:13,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:13,221 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:13,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:13,221 INFO L82 PathProgramCache]: Analyzing trace with hash 533330474, now seen corresponding path program 1 times [2019-09-08 12:09:13,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:13,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:13,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:13,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:13,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:13,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:13,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:13,465 INFO L87 Difference]: Start difference. First operand 397 states and 510 transitions. Second operand 9 states. [2019-09-08 12:09:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:14,819 INFO L93 Difference]: Finished difference Result 874 states and 1165 transitions. [2019-09-08 12:09:14,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:14,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:09:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:14,828 INFO L225 Difference]: With dead ends: 874 [2019-09-08 12:09:14,828 INFO L226 Difference]: Without dead ends: 745 [2019-09-08 12:09:14,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-09-08 12:09:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 397. [2019-09-08 12:09:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 509 transitions. [2019-09-08 12:09:14,865 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 509 transitions. Word has length 81 [2019-09-08 12:09:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:14,866 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 509 transitions. [2019-09-08 12:09:14,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 509 transitions. [2019-09-08 12:09:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:09:14,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:14,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:14,869 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1325711291, now seen corresponding path program 1 times [2019-09-08 12:09:14,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:14,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:14,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:15,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:15,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:09:15,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:09:15,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:09:15,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:09:15,166 INFO L87 Difference]: Start difference. First operand 397 states and 509 transitions. Second operand 8 states. [2019-09-08 12:09:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:15,933 INFO L93 Difference]: Finished difference Result 764 states and 967 transitions. [2019-09-08 12:09:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:09:15,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-09-08 12:09:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:15,937 INFO L225 Difference]: With dead ends: 764 [2019-09-08 12:09:15,937 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 12:09:15,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:09:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 12:09:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 397. [2019-09-08 12:09:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 508 transitions. [2019-09-08 12:09:15,966 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 508 transitions. Word has length 81 [2019-09-08 12:09:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:15,967 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 508 transitions. [2019-09-08 12:09:15,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:09:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 508 transitions. [2019-09-08 12:09:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:09:15,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:15,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:15,969 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:15,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1670879057, now seen corresponding path program 1 times [2019-09-08 12:09:15,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:15,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:15,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:15,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:15,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:16,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:16,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:16,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:16,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:16,149 INFO L87 Difference]: Start difference. First operand 397 states and 508 transitions. Second operand 9 states. [2019-09-08 12:09:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:17,782 INFO L93 Difference]: Finished difference Result 806 states and 1069 transitions. [2019-09-08 12:09:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:17,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:09:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:17,790 INFO L225 Difference]: With dead ends: 806 [2019-09-08 12:09:17,791 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 12:09:17,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 12:09:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-08 12:09:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 507 transitions. [2019-09-08 12:09:17,823 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 507 transitions. Word has length 83 [2019-09-08 12:09:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:17,824 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 507 transitions. [2019-09-08 12:09:17,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 507 transitions. [2019-09-08 12:09:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:09:17,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:17,826 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:17,826 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:17,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2064402550, now seen corresponding path program 1 times [2019-09-08 12:09:17,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:17,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:17,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:17,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:17,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:18,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:18,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:18,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:18,055 INFO L87 Difference]: Start difference. First operand 397 states and 507 transitions. Second operand 9 states. [2019-09-08 12:09:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:19,356 INFO L93 Difference]: Finished difference Result 810 states and 1071 transitions. [2019-09-08 12:09:19,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:19,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:09:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:19,361 INFO L225 Difference]: With dead ends: 810 [2019-09-08 12:09:19,362 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 12:09:19,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 12:09:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-08 12:09:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 506 transitions. [2019-09-08 12:09:19,397 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 506 transitions. Word has length 83 [2019-09-08 12:09:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:19,397 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 506 transitions. [2019-09-08 12:09:19,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 506 transitions. [2019-09-08 12:09:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:09:19,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:19,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:19,400 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1181772490, now seen corresponding path program 1 times [2019-09-08 12:09:19,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:19,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:19,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:19,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:19,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:19,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:19,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:19,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:19,602 INFO L87 Difference]: Start difference. First operand 397 states and 506 transitions. Second operand 9 states. [2019-09-08 12:09:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:21,087 INFO L93 Difference]: Finished difference Result 810 states and 1070 transitions. [2019-09-08 12:09:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:21,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:09:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:21,093 INFO L225 Difference]: With dead ends: 810 [2019-09-08 12:09:21,093 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 12:09:21,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 12:09:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-08 12:09:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 505 transitions. [2019-09-08 12:09:21,129 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 505 transitions. Word has length 83 [2019-09-08 12:09:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:21,129 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 505 transitions. [2019-09-08 12:09:21,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 505 transitions. [2019-09-08 12:09:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:09:21,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:21,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:21,132 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash -876834767, now seen corresponding path program 1 times [2019-09-08 12:09:21,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:21,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:21,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:21,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:21,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:21,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:21,296 INFO L87 Difference]: Start difference. First operand 397 states and 505 transitions. Second operand 9 states. [2019-09-08 12:09:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:22,802 INFO L93 Difference]: Finished difference Result 840 states and 1113 transitions. [2019-09-08 12:09:22,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:22,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:09:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:22,806 INFO L225 Difference]: With dead ends: 840 [2019-09-08 12:09:22,807 INFO L226 Difference]: Without dead ends: 741 [2019-09-08 12:09:22,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:22,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-08 12:09:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 397. [2019-09-08 12:09:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 504 transitions. [2019-09-08 12:09:22,839 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 504 transitions. Word has length 83 [2019-09-08 12:09:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:22,840 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 504 transitions. [2019-09-08 12:09:22,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 504 transitions. [2019-09-08 12:09:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:09:22,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:22,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:22,842 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:22,843 INFO L82 PathProgramCache]: Analyzing trace with hash 287644134, now seen corresponding path program 1 times [2019-09-08 12:09:22,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:22,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:22,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:22,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:22,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:23,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:23,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:23,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:23,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:23,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:23,045 INFO L87 Difference]: Start difference. First operand 397 states and 504 transitions. Second operand 9 states. [2019-09-08 12:09:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:24,607 INFO L93 Difference]: Finished difference Result 810 states and 1067 transitions. [2019-09-08 12:09:24,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:24,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:09:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:24,613 INFO L225 Difference]: With dead ends: 810 [2019-09-08 12:09:24,613 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 12:09:24,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 12:09:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-08 12:09:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 503 transitions. [2019-09-08 12:09:24,645 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 503 transitions. Word has length 83 [2019-09-08 12:09:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:24,646 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 503 transitions. [2019-09-08 12:09:24,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 503 transitions. [2019-09-08 12:09:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:09:24,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:24,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:24,648 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:24,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1062374831, now seen corresponding path program 1 times [2019-09-08 12:09:24,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:24,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:24,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:24,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:24,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:24,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:24,800 INFO L87 Difference]: Start difference. First operand 397 states and 503 transitions. Second operand 9 states. [2019-09-08 12:09:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:26,282 INFO L93 Difference]: Finished difference Result 840 states and 1108 transitions. [2019-09-08 12:09:26,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:26,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:09:26,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:26,286 INFO L225 Difference]: With dead ends: 840 [2019-09-08 12:09:26,287 INFO L226 Difference]: Without dead ends: 741 [2019-09-08 12:09:26,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-08 12:09:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 397. [2019-09-08 12:09:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 502 transitions. [2019-09-08 12:09:26,321 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 502 transitions. Word has length 83 [2019-09-08 12:09:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:26,321 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 502 transitions. [2019-09-08 12:09:26,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 502 transitions. [2019-09-08 12:09:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:09:26,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:26,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:26,324 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:26,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1850218341, now seen corresponding path program 1 times [2019-09-08 12:09:26,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:26,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:26,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:26,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:26,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:26,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:26,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:26,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:26,491 INFO L87 Difference]: Start difference. First operand 397 states and 502 transitions. Second operand 9 states. [2019-09-08 12:09:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:27,820 INFO L93 Difference]: Finished difference Result 889 states and 1168 transitions. [2019-09-08 12:09:27,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:27,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:09:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:27,824 INFO L225 Difference]: With dead ends: 889 [2019-09-08 12:09:27,825 INFO L226 Difference]: Without dead ends: 745 [2019-09-08 12:09:27,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-09-08 12:09:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 397. [2019-09-08 12:09:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 501 transitions. [2019-09-08 12:09:27,859 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 501 transitions. Word has length 83 [2019-09-08 12:09:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:27,860 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 501 transitions. [2019-09-08 12:09:27,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 501 transitions. [2019-09-08 12:09:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:27,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:27,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:27,862 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:27,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1299527057, now seen corresponding path program 1 times [2019-09-08 12:09:27,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:27,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:27,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:27,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:27,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:28,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:28,037 INFO L87 Difference]: Start difference. First operand 397 states and 501 transitions. Second operand 9 states. [2019-09-08 12:09:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:29,606 INFO L93 Difference]: Finished difference Result 784 states and 1025 transitions. [2019-09-08 12:09:29,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:29,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:29,611 INFO L225 Difference]: With dead ends: 784 [2019-09-08 12:09:29,611 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:29,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 500 transitions. [2019-09-08 12:09:29,646 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 500 transitions. Word has length 85 [2019-09-08 12:09:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:29,646 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 500 transitions. [2019-09-08 12:09:29,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 500 transitions. [2019-09-08 12:09:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:29,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:29,648 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:29,649 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash -716975399, now seen corresponding path program 1 times [2019-09-08 12:09:29,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:29,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:29,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:29,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:29,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:29,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:29,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:29,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:29,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:29,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:29,791 INFO L87 Difference]: Start difference. First operand 397 states and 500 transitions. Second operand 9 states. [2019-09-08 12:09:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:31,142 INFO L93 Difference]: Finished difference Result 782 states and 1021 transitions. [2019-09-08 12:09:31,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:31,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:31,147 INFO L225 Difference]: With dead ends: 782 [2019-09-08 12:09:31,147 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:31,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 499 transitions. [2019-09-08 12:09:31,183 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 499 transitions. Word has length 85 [2019-09-08 12:09:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:31,184 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 499 transitions. [2019-09-08 12:09:31,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 499 transitions. [2019-09-08 12:09:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:31,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:31,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:31,186 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash 777191179, now seen corresponding path program 1 times [2019-09-08 12:09:31,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:31,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:31,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:31,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:31,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:31,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:31,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:31,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:31,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:31,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:31,460 INFO L87 Difference]: Start difference. First operand 397 states and 499 transitions. Second operand 9 states. [2019-09-08 12:09:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:32,687 INFO L93 Difference]: Finished difference Result 784 states and 1022 transitions. [2019-09-08 12:09:32,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:32,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:32,690 INFO L225 Difference]: With dead ends: 784 [2019-09-08 12:09:32,690 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:32,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 498 transitions. [2019-09-08 12:09:32,726 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 498 transitions. Word has length 85 [2019-09-08 12:09:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:32,727 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 498 transitions. [2019-09-08 12:09:32,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 498 transitions. [2019-09-08 12:09:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:32,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:32,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:32,729 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash -496308349, now seen corresponding path program 1 times [2019-09-08 12:09:32,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:32,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:32,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:32,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:32,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:32,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:32,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:32,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:32,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:32,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:32,874 INFO L87 Difference]: Start difference. First operand 397 states and 498 transitions. Second operand 9 states. [2019-09-08 12:09:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:34,361 INFO L93 Difference]: Finished difference Result 722 states and 928 transitions. [2019-09-08 12:09:34,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:34,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:34,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:34,364 INFO L225 Difference]: With dead ends: 722 [2019-09-08 12:09:34,364 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:34,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 497 transitions. [2019-09-08 12:09:34,403 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 497 transitions. Word has length 85 [2019-09-08 12:09:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:34,403 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 497 transitions. [2019-09-08 12:09:34,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 497 transitions. [2019-09-08 12:09:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:34,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:34,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:34,405 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2124094268, now seen corresponding path program 1 times [2019-09-08 12:09:34,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:34,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:34,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:34,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:34,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:34,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:34,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:34,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:34,548 INFO L87 Difference]: Start difference. First operand 397 states and 497 transitions. Second operand 9 states. [2019-09-08 12:09:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:35,988 INFO L93 Difference]: Finished difference Result 787 states and 1022 transitions. [2019-09-08 12:09:35,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:35,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:35,992 INFO L225 Difference]: With dead ends: 787 [2019-09-08 12:09:35,993 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:35,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 496 transitions. [2019-09-08 12:09:36,032 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 496 transitions. Word has length 85 [2019-09-08 12:09:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:36,032 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 496 transitions. [2019-09-08 12:09:36,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 496 transitions. [2019-09-08 12:09:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:36,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:36,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:36,034 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash -194937756, now seen corresponding path program 1 times [2019-09-08 12:09:36,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:36,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:36,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:36,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:36,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:36,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:36,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:36,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:36,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:36,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:36,182 INFO L87 Difference]: Start difference. First operand 397 states and 496 transitions. Second operand 9 states. [2019-09-08 12:09:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:37,492 INFO L93 Difference]: Finished difference Result 815 states and 1061 transitions. [2019-09-08 12:09:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:37,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:37,495 INFO L225 Difference]: With dead ends: 815 [2019-09-08 12:09:37,495 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 12:09:37,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 12:09:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-08 12:09:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 495 transitions. [2019-09-08 12:09:37,528 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 495 transitions. Word has length 85 [2019-09-08 12:09:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:37,528 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 495 transitions. [2019-09-08 12:09:37,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 495 transitions. [2019-09-08 12:09:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:37,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:37,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:37,530 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1160181619, now seen corresponding path program 1 times [2019-09-08 12:09:37,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:37,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:37,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:37,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:37,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:37,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:37,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:37,676 INFO L87 Difference]: Start difference. First operand 397 states and 495 transitions. Second operand 9 states. [2019-09-08 12:09:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:39,034 INFO L93 Difference]: Finished difference Result 784 states and 1017 transitions. [2019-09-08 12:09:39,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:39,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:39,040 INFO L225 Difference]: With dead ends: 784 [2019-09-08 12:09:39,040 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:39,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 494 transitions. [2019-09-08 12:09:39,078 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 494 transitions. Word has length 85 [2019-09-08 12:09:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:39,079 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 494 transitions. [2019-09-08 12:09:39,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 494 transitions. [2019-09-08 12:09:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:39,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:39,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:39,081 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:39,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1009658424, now seen corresponding path program 1 times [2019-09-08 12:09:39,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:39,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:39,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:39,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:39,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:39,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:39,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:39,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:39,219 INFO L87 Difference]: Start difference. First operand 397 states and 494 transitions. Second operand 9 states. [2019-09-08 12:09:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:40,723 INFO L93 Difference]: Finished difference Result 787 states and 1019 transitions. [2019-09-08 12:09:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:40,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:40,726 INFO L225 Difference]: With dead ends: 787 [2019-09-08 12:09:40,726 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:40,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 493 transitions. [2019-09-08 12:09:40,765 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 493 transitions. Word has length 85 [2019-09-08 12:09:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:40,766 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 493 transitions. [2019-09-08 12:09:40,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 493 transitions. [2019-09-08 12:09:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:40,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:40,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:40,768 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -527052732, now seen corresponding path program 1 times [2019-09-08 12:09:40,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:40,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:40,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:40,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:40,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:40,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:40,904 INFO L87 Difference]: Start difference. First operand 397 states and 493 transitions. Second operand 9 states. [2019-09-08 12:09:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:42,407 INFO L93 Difference]: Finished difference Result 787 states and 1017 transitions. [2019-09-08 12:09:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:42,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:42,412 INFO L225 Difference]: With dead ends: 787 [2019-09-08 12:09:42,412 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:42,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 492 transitions. [2019-09-08 12:09:42,449 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 492 transitions. Word has length 85 [2019-09-08 12:09:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:42,450 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 492 transitions. [2019-09-08 12:09:42,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 492 transitions. [2019-09-08 12:09:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:42,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:42,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:42,452 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:42,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1402103780, now seen corresponding path program 1 times [2019-09-08 12:09:42,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:42,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:42,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:42,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:42,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:42,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:42,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:42,608 INFO L87 Difference]: Start difference. First operand 397 states and 492 transitions. Second operand 9 states. [2019-09-08 12:09:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:44,042 INFO L93 Difference]: Finished difference Result 815 states and 1056 transitions. [2019-09-08 12:09:44,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:44,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:44,046 INFO L225 Difference]: With dead ends: 815 [2019-09-08 12:09:44,046 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 12:09:44,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 12:09:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-08 12:09:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 491 transitions. [2019-09-08 12:09:44,082 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 491 transitions. Word has length 85 [2019-09-08 12:09:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:44,082 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 491 transitions. [2019-09-08 12:09:44,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 491 transitions. [2019-09-08 12:09:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:44,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:44,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:44,084 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1985070686, now seen corresponding path program 1 times [2019-09-08 12:09:44,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:44,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:44,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:44,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:44,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:44,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:44,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:44,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:44,221 INFO L87 Difference]: Start difference. First operand 397 states and 491 transitions. Second operand 9 states. [2019-09-08 12:09:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:45,799 INFO L93 Difference]: Finished difference Result 846 states and 1097 transitions. [2019-09-08 12:09:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:45,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:45,802 INFO L225 Difference]: With dead ends: 846 [2019-09-08 12:09:45,803 INFO L226 Difference]: Without dead ends: 741 [2019-09-08 12:09:45,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-08 12:09:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 397. [2019-09-08 12:09:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 490 transitions. [2019-09-08 12:09:45,846 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 490 transitions. Word has length 85 [2019-09-08 12:09:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:45,846 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 490 transitions. [2019-09-08 12:09:45,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 490 transitions. [2019-09-08 12:09:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:45,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:45,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:45,848 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1621426561, now seen corresponding path program 1 times [2019-09-08 12:09:45,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:45,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:45,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:45,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:45,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:45,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:45,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:45,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:45,995 INFO L87 Difference]: Start difference. First operand 397 states and 490 transitions. Second operand 9 states. [2019-09-08 12:09:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:47,394 INFO L93 Difference]: Finished difference Result 722 states and 918 transitions. [2019-09-08 12:09:47,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:47,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:47,399 INFO L225 Difference]: With dead ends: 722 [2019-09-08 12:09:47,399 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:47,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 489 transitions. [2019-09-08 12:09:47,434 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 489 transitions. Word has length 85 [2019-09-08 12:09:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:47,434 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 489 transitions. [2019-09-08 12:09:47,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 489 transitions. [2019-09-08 12:09:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:47,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:47,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:47,436 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1236378400, now seen corresponding path program 1 times [2019-09-08 12:09:47,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:47,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:47,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:47,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:47,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:47,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:47,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:47,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:47,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:47,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:47,575 INFO L87 Difference]: Start difference. First operand 397 states and 489 transitions. Second operand 9 states. [2019-09-08 12:09:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:49,070 INFO L93 Difference]: Finished difference Result 750 states and 956 transitions. [2019-09-08 12:09:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:49,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:49,073 INFO L225 Difference]: With dead ends: 750 [2019-09-08 12:09:49,073 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 12:09:49,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 12:09:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 397. [2019-09-08 12:09:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 488 transitions. [2019-09-08 12:09:49,112 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 488 transitions. Word has length 85 [2019-09-08 12:09:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:49,112 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 488 transitions. [2019-09-08 12:09:49,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 488 transitions. [2019-09-08 12:09:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:49,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:49,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:49,114 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1585291813, now seen corresponding path program 1 times [2019-09-08 12:09:49,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:49,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:49,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:49,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:49,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:49,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:49,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:49,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:49,250 INFO L87 Difference]: Start difference. First operand 397 states and 488 transitions. Second operand 9 states. [2019-09-08 12:09:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:50,721 INFO L93 Difference]: Finished difference Result 784 states and 1009 transitions. [2019-09-08 12:09:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:50,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:50,725 INFO L225 Difference]: With dead ends: 784 [2019-09-08 12:09:50,725 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:50,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 487 transitions. [2019-09-08 12:09:50,758 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 487 transitions. Word has length 85 [2019-09-08 12:09:50,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:50,758 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 487 transitions. [2019-09-08 12:09:50,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:50,758 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 487 transitions. [2019-09-08 12:09:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:09:50,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:50,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:50,759 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1435826419, now seen corresponding path program 1 times [2019-09-08 12:09:50,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:50,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:50,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:50,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:50,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:50,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:50,917 INFO L87 Difference]: Start difference. First operand 397 states and 487 transitions. Second operand 9 states. [2019-09-08 12:09:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:52,534 INFO L93 Difference]: Finished difference Result 722 states and 915 transitions. [2019-09-08 12:09:52,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:09:52,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 12:09:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:52,543 INFO L225 Difference]: With dead ends: 722 [2019-09-08 12:09:52,543 INFO L226 Difference]: Without dead ends: 717 [2019-09-08 12:09:52,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:09:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-08 12:09:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 397. [2019-09-08 12:09:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:09:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 486 transitions. [2019-09-08 12:09:52,584 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 486 transitions. Word has length 85 [2019-09-08 12:09:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:52,585 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 486 transitions. [2019-09-08 12:09:52,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:09:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 486 transitions. [2019-09-08 12:09:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:09:52,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:52,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:52,587 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1981907169, now seen corresponding path program 1 times [2019-09-08 12:09:52,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:52,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:52,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:52,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:52,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:53,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:53,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:09:53,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:09:53,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:09:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:09:53,890 INFO L87 Difference]: Start difference. First operand 397 states and 486 transitions. Second operand 22 states. [2019-09-08 12:09:54,918 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-08 12:09:55,166 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-08 12:09:55,548 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-08 12:09:55,707 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:09:55,905 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:09:56,103 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:09:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:59,934 INFO L93 Difference]: Finished difference Result 823 states and 1043 transitions. [2019-09-08 12:09:59,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:09:59,935 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-09-08 12:09:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:59,938 INFO L225 Difference]: With dead ends: 823 [2019-09-08 12:09:59,939 INFO L226 Difference]: Without dead ends: 755 [2019-09-08 12:09:59,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:09:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-08 12:09:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 403. [2019-09-08 12:09:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-08 12:09:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 492 transitions. [2019-09-08 12:09:59,998 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 492 transitions. Word has length 87 [2019-09-08 12:09:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:59,999 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 492 transitions. [2019-09-08 12:09:59,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:09:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 492 transitions. [2019-09-08 12:10:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:00,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:00,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:00,001 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash 500673725, now seen corresponding path program 1 times [2019-09-08 12:10:00,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:00,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:00,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:00,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:00,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:10:00,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:10:00,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:10:00,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:10:00,722 INFO L87 Difference]: Start difference. First operand 403 states and 492 transitions. Second operand 17 states. [2019-09-08 12:10:01,304 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:10:01,477 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:10:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:03,003 INFO L93 Difference]: Finished difference Result 903 states and 1159 transitions. [2019-09-08 12:10:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:10:03,004 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 12:10:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:03,008 INFO L225 Difference]: With dead ends: 903 [2019-09-08 12:10:03,009 INFO L226 Difference]: Without dead ends: 787 [2019-09-08 12:10:03,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:10:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-08 12:10:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 378. [2019-09-08 12:10:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-09-08 12:10:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 459 transitions. [2019-09-08 12:10:03,058 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 459 transitions. Word has length 87 [2019-09-08 12:10:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:03,058 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 459 transitions. [2019-09-08 12:10:03,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:10:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 459 transitions. [2019-09-08 12:10:03,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:03,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:03,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:03,060 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:03,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:03,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2120669208, now seen corresponding path program 1 times [2019-09-08 12:10:03,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:03,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:03,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:03,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:03,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:10:03,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:10:03,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:10:03,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:10:03,755 INFO L87 Difference]: Start difference. First operand 378 states and 459 transitions. Second operand 17 states. [2019-09-08 12:10:04,330 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:10:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:06,859 INFO L93 Difference]: Finished difference Result 814 states and 1038 transitions. [2019-09-08 12:10:06,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:10:06,860 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 12:10:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:06,862 INFO L225 Difference]: With dead ends: 814 [2019-09-08 12:10:06,862 INFO L226 Difference]: Without dead ends: 742 [2019-09-08 12:10:06,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:10:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-08 12:10:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 377. [2019-09-08 12:10:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 12:10:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 456 transitions. [2019-09-08 12:10:06,912 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 456 transitions. Word has length 87 [2019-09-08 12:10:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:06,913 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 456 transitions. [2019-09-08 12:10:06,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:10:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 456 transitions. [2019-09-08 12:10:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:06,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:06,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:06,914 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 607545151, now seen corresponding path program 1 times [2019-09-08 12:10:06,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:06,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:06,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:06,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:07,768 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 12:10:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:08,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:08,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:10:08,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:10:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:10:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:10:08,416 INFO L87 Difference]: Start difference. First operand 377 states and 456 transitions. Second operand 25 states. [2019-09-08 12:10:09,401 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-08 12:10:09,685 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-08 12:10:09,965 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2019-09-08 12:10:10,325 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 74 [2019-09-08 12:10:10,547 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 12:10:10,751 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 12:10:10,939 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-08 12:10:11,141 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-08 12:10:11,332 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-08 12:10:11,554 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:10:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:15,646 INFO L93 Difference]: Finished difference Result 849 states and 1063 transitions. [2019-09-08 12:10:15,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:10:15,647 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-09-08 12:10:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:15,649 INFO L225 Difference]: With dead ends: 849 [2019-09-08 12:10:15,649 INFO L226 Difference]: Without dead ends: 756 [2019-09-08 12:10:15,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:10:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-09-08 12:10:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 388. [2019-09-08 12:10:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-08 12:10:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 468 transitions. [2019-09-08 12:10:15,715 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 468 transitions. Word has length 87 [2019-09-08 12:10:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:15,716 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 468 transitions. [2019-09-08 12:10:15,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:10:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 468 transitions. [2019-09-08 12:10:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:15,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:15,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:15,717 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1697656993, now seen corresponding path program 1 times [2019-09-08 12:10:15,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:15,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:15,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:16,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:16,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:10:16,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:10:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:10:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:10:16,218 INFO L87 Difference]: Start difference. First operand 388 states and 468 transitions. Second operand 15 states. [2019-09-08 12:10:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:18,173 INFO L93 Difference]: Finished difference Result 873 states and 1111 transitions. [2019-09-08 12:10:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:10:18,173 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-09-08 12:10:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:18,175 INFO L225 Difference]: With dead ends: 873 [2019-09-08 12:10:18,175 INFO L226 Difference]: Without dead ends: 708 [2019-09-08 12:10:18,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:10:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-08 12:10:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 347. [2019-09-08 12:10:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-08 12:10:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 419 transitions. [2019-09-08 12:10:18,224 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 419 transitions. Word has length 87 [2019-09-08 12:10:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:18,224 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 419 transitions. [2019-09-08 12:10:18,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:10:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 419 transitions. [2019-09-08 12:10:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:18,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:18,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:18,225 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2061124639, now seen corresponding path program 1 times [2019-09-08 12:10:18,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:18,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:18,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:18,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:18,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:18,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:18,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:10:18,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:10:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:10:18,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:10:18,853 INFO L87 Difference]: Start difference. First operand 347 states and 419 transitions. Second operand 17 states. [2019-09-08 12:10:19,493 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:10:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:21,293 INFO L93 Difference]: Finished difference Result 766 states and 981 transitions. [2019-09-08 12:10:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:10:21,293 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 12:10:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:21,295 INFO L225 Difference]: With dead ends: 766 [2019-09-08 12:10:21,295 INFO L226 Difference]: Without dead ends: 672 [2019-09-08 12:10:21,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:10:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-08 12:10:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 336. [2019-09-08 12:10:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-08 12:10:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 404 transitions. [2019-09-08 12:10:21,344 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 404 transitions. Word has length 87 [2019-09-08 12:10:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:21,345 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 404 transitions. [2019-09-08 12:10:21,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:10:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 404 transitions. [2019-09-08 12:10:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:21,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:21,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:21,346 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash 555238255, now seen corresponding path program 1 times [2019-09-08 12:10:21,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:21,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:21,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:23,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:23,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:10:23,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:10:23,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:10:23,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:10:23,208 INFO L87 Difference]: Start difference. First operand 336 states and 404 transitions. Second operand 26 states. [2019-09-08 12:10:23,374 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:10:24,355 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 12:10:24,569 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 12:10:24,865 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-08 12:10:25,299 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2019-09-08 12:10:25,518 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 12:10:25,745 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 12:10:25,994 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-08 12:10:28,816 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 12:10:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:29,829 INFO L93 Difference]: Finished difference Result 703 states and 867 transitions. [2019-09-08 12:10:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:10:29,829 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2019-09-08 12:10:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:29,833 INFO L225 Difference]: With dead ends: 703 [2019-09-08 12:10:29,833 INFO L226 Difference]: Without dead ends: 634 [2019-09-08 12:10:29,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 12:10:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-08 12:10:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 356. [2019-09-08 12:10:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-08 12:10:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 431 transitions. [2019-09-08 12:10:29,890 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 431 transitions. Word has length 87 [2019-09-08 12:10:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:29,890 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 431 transitions. [2019-09-08 12:10:29,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:10:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 431 transitions. [2019-09-08 12:10:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:29,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:29,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:29,892 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1881074051, now seen corresponding path program 1 times [2019-09-08 12:10:29,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:29,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:30,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:30,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:10:30,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:10:30,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:10:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:10:30,599 INFO L87 Difference]: Start difference. First operand 356 states and 431 transitions. Second operand 16 states. [2019-09-08 12:10:31,192 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:10:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:32,910 INFO L93 Difference]: Finished difference Result 625 states and 748 transitions. [2019-09-08 12:10:32,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:10:32,910 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-09-08 12:10:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:32,912 INFO L225 Difference]: With dead ends: 625 [2019-09-08 12:10:32,912 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 12:10:32,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:10:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 12:10:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 373. [2019-09-08 12:10:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 12:10:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 455 transitions. [2019-09-08 12:10:33,003 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 455 transitions. Word has length 87 [2019-09-08 12:10:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:33,004 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 455 transitions. [2019-09-08 12:10:33,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:10:33,004 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 455 transitions. [2019-09-08 12:10:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:10:33,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:33,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:33,005 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:33,005 INFO L82 PathProgramCache]: Analyzing trace with hash -525959545, now seen corresponding path program 1 times [2019-09-08 12:10:33,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:33,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:33,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:33,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:33,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:33,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:33,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:10:33,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:10:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:10:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:10:33,784 INFO L87 Difference]: Start difference. First operand 373 states and 455 transitions. Second operand 17 states. [2019-09-08 12:10:34,353 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:10:34,504 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:10:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:35,996 INFO L93 Difference]: Finished difference Result 771 states and 992 transitions. [2019-09-08 12:10:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:10:35,997 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 12:10:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:36,000 INFO L225 Difference]: With dead ends: 771 [2019-09-08 12:10:36,000 INFO L226 Difference]: Without dead ends: 635 [2019-09-08 12:10:36,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:10:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-08 12:10:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 349. [2019-09-08 12:10:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-08 12:10:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 422 transitions. [2019-09-08 12:10:36,062 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 422 transitions. Word has length 87 [2019-09-08 12:10:36,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:36,062 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 422 transitions. [2019-09-08 12:10:36,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:10:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 422 transitions. [2019-09-08 12:10:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:10:36,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:36,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:36,064 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash -285902363, now seen corresponding path program 1 times [2019-09-08 12:10:36,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:36,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:36,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:36,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:36,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:36,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:36,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:10:36,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:10:36,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:10:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:10:36,725 INFO L87 Difference]: Start difference. First operand 349 states and 422 transitions. Second operand 15 states. [2019-09-08 12:10:36,909 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 12:10:37,249 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:10:37,473 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:10:37,739 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:10:37,950 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-08 12:10:38,180 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-08 12:10:38,419 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-08 12:10:38,948 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-08 12:10:39,412 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-08 12:10:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:41,354 INFO L93 Difference]: Finished difference Result 1342 states and 1801 transitions. [2019-09-08 12:10:41,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:10:41,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2019-09-08 12:10:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:41,360 INFO L225 Difference]: With dead ends: 1342 [2019-09-08 12:10:41,360 INFO L226 Difference]: Without dead ends: 1257 [2019-09-08 12:10:41,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=234, Invalid=758, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:10:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-09-08 12:10:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 318. [2019-09-08 12:10:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-08 12:10:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 382 transitions. [2019-09-08 12:10:41,450 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 382 transitions. Word has length 88 [2019-09-08 12:10:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:41,450 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 382 transitions. [2019-09-08 12:10:41,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:10:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 382 transitions. [2019-09-08 12:10:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:10:41,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:41,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:41,451 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1241895498, now seen corresponding path program 1 times [2019-09-08 12:10:41,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:41,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:41,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:41,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:41,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:10:41,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:10:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:10:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:10:41,840 INFO L87 Difference]: Start difference. First operand 318 states and 382 transitions. Second operand 12 states. [2019-09-08 12:10:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:42,916 INFO L93 Difference]: Finished difference Result 534 states and 665 transitions. [2019-09-08 12:10:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:10:42,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-08 12:10:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:42,918 INFO L225 Difference]: With dead ends: 534 [2019-09-08 12:10:42,918 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 12:10:42,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:10:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 12:10:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 314. [2019-09-08 12:10:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 12:10:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 377 transitions. [2019-09-08 12:10:42,981 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 377 transitions. Word has length 88 [2019-09-08 12:10:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:42,982 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 377 transitions. [2019-09-08 12:10:42,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:10:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 377 transitions. [2019-09-08 12:10:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:10:42,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:42,983 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:42,983 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash 747869654, now seen corresponding path program 1 times [2019-09-08 12:10:42,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:42,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:42,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:43,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:43,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:10:43,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:10:43,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:10:43,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:10:43,655 INFO L87 Difference]: Start difference. First operand 314 states and 377 transitions. Second operand 16 states. [2019-09-08 12:10:44,378 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 12:10:44,831 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:10:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:46,683 INFO L93 Difference]: Finished difference Result 1054 states and 1406 transitions. [2019-09-08 12:10:46,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:10:46,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-08 12:10:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:46,685 INFO L225 Difference]: With dead ends: 1054 [2019-09-08 12:10:46,685 INFO L226 Difference]: Without dead ends: 965 [2019-09-08 12:10:46,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:10:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-08 12:10:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 290. [2019-09-08 12:10:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-08 12:10:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 346 transitions. [2019-09-08 12:10:46,749 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 346 transitions. Word has length 88 [2019-09-08 12:10:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:46,749 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 346 transitions. [2019-09-08 12:10:46,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:10:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 346 transitions. [2019-09-08 12:10:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:10:46,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:46,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:46,750 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash -493449678, now seen corresponding path program 1 times [2019-09-08 12:10:46,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:46,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:46,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:47,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:47,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:10:47,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:10:47,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:10:47,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:10:47,122 INFO L87 Difference]: Start difference. First operand 290 states and 346 transitions. Second operand 12 states. [2019-09-08 12:10:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:48,383 INFO L93 Difference]: Finished difference Result 761 states and 1011 transitions. [2019-09-08 12:10:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:10:48,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-08 12:10:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:48,385 INFO L225 Difference]: With dead ends: 761 [2019-09-08 12:10:48,385 INFO L226 Difference]: Without dead ends: 674 [2019-09-08 12:10:48,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:10:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-08 12:10:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 268. [2019-09-08 12:10:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-08 12:10:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 321 transitions. [2019-09-08 12:10:48,473 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 321 transitions. Word has length 88 [2019-09-08 12:10:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:48,473 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 321 transitions. [2019-09-08 12:10:48,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:10:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 321 transitions. [2019-09-08 12:10:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:10:48,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:48,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:48,474 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 479313184, now seen corresponding path program 1 times [2019-09-08 12:10:48,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:48,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:48,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:48,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:48,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:10:48,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:10:48,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:10:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:10:48,597 INFO L87 Difference]: Start difference. First operand 268 states and 321 transitions. Second operand 9 states. [2019-09-08 12:10:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:49,821 INFO L93 Difference]: Finished difference Result 605 states and 787 transitions. [2019-09-08 12:10:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:10:49,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 12:10:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:49,823 INFO L225 Difference]: With dead ends: 605 [2019-09-08 12:10:49,823 INFO L226 Difference]: Without dead ends: 522 [2019-09-08 12:10:49,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:10:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-08 12:10:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 268. [2019-09-08 12:10:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-08 12:10:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2019-09-08 12:10:49,888 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 88 [2019-09-08 12:10:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:49,888 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2019-09-08 12:10:49,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2019-09-08 12:10:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:10:49,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:49,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:49,889 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:49,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:49,889 INFO L82 PathProgramCache]: Analyzing trace with hash -134912059, now seen corresponding path program 1 times [2019-09-08 12:10:49,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:49,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:49,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:49,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:50,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:50,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:10:50,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:10:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:10:50,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:10:50,478 INFO L87 Difference]: Start difference. First operand 268 states and 320 transitions. Second operand 16 states. [2019-09-08 12:10:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:52,200 INFO L93 Difference]: Finished difference Result 483 states and 605 transitions. [2019-09-08 12:10:52,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:10:52,201 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-08 12:10:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:52,202 INFO L225 Difference]: With dead ends: 483 [2019-09-08 12:10:52,202 INFO L226 Difference]: Without dead ends: 407 [2019-09-08 12:10:52,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:10:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-08 12:10:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 257. [2019-09-08 12:10:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-08 12:10:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2019-09-08 12:10:52,273 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 88 [2019-09-08 12:10:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:52,273 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2019-09-08 12:10:52,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:10:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2019-09-08 12:10:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:10:52,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:52,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:52,274 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1795581947, now seen corresponding path program 1 times [2019-09-08 12:10:52,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:52,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:52,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:52,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:52,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:10:52,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:10:52,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:10:52,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:10:52,695 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand 12 states. [2019-09-08 12:10:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:53,702 INFO L93 Difference]: Finished difference Result 675 states and 886 transitions. [2019-09-08 12:10:53,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:10:53,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-08 12:10:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:53,704 INFO L225 Difference]: With dead ends: 675 [2019-09-08 12:10:53,704 INFO L226 Difference]: Without dead ends: 631 [2019-09-08 12:10:53,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:10:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-08 12:10:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 207. [2019-09-08 12:10:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-08 12:10:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2019-09-08 12:10:53,764 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 89 [2019-09-08 12:10:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:53,764 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2019-09-08 12:10:53,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:10:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2019-09-08 12:10:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:10:53,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:53,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:53,765 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:53,766 INFO L82 PathProgramCache]: Analyzing trace with hash -842661870, now seen corresponding path program 1 times [2019-09-08 12:10:53,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:53,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:53,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:10:54,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:10:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:10:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:10:54,225 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand 11 states. [2019-09-08 12:10:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:55,551 INFO L93 Difference]: Finished difference Result 778 states and 1064 transitions. [2019-09-08 12:10:55,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:10:55,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 12:10:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:55,553 INFO L225 Difference]: With dead ends: 778 [2019-09-08 12:10:55,554 INFO L226 Difference]: Without dead ends: 673 [2019-09-08 12:10:55,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:10:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-08 12:10:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 167. [2019-09-08 12:10:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-08 12:10:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 203 transitions. [2019-09-08 12:10:55,611 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 203 transitions. Word has length 89 [2019-09-08 12:10:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:55,611 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 203 transitions. [2019-09-08 12:10:55,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:10:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 203 transitions. [2019-09-08 12:10:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:10:55,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:55,612 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:55,612 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash 576556054, now seen corresponding path program 1 times [2019-09-08 12:10:55,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:55,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:55,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:56,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:56,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:10:56,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:10:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:10:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:10:56,062 INFO L87 Difference]: Start difference. First operand 167 states and 203 transitions. Second operand 13 states. [2019-09-08 12:10:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:57,561 INFO L93 Difference]: Finished difference Result 525 states and 714 transitions. [2019-09-08 12:10:57,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:10:57,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-08 12:10:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:57,563 INFO L225 Difference]: With dead ends: 525 [2019-09-08 12:10:57,564 INFO L226 Difference]: Without dead ends: 519 [2019-09-08 12:10:57,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:10:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-08 12:10:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 161. [2019-09-08 12:10:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-08 12:10:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 197 transitions. [2019-09-08 12:10:57,618 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 197 transitions. Word has length 90 [2019-09-08 12:10:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:57,618 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 197 transitions. [2019-09-08 12:10:57,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:10:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 197 transitions. [2019-09-08 12:10:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:10:57,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:57,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:57,619 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1222425115, now seen corresponding path program 1 times [2019-09-08 12:10:57,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:57,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:57,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:57,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:57,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:57,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:10:57,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:10:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:10:57,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:10:57,716 INFO L87 Difference]: Start difference. First operand 161 states and 197 transitions. Second operand 3 states. [2019-09-08 12:10:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:57,875 INFO L93 Difference]: Finished difference Result 287 states and 379 transitions. [2019-09-08 12:10:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:10:57,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 12:10:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:57,876 INFO L225 Difference]: With dead ends: 287 [2019-09-08 12:10:57,876 INFO L226 Difference]: Without dead ends: 222 [2019-09-08 12:10:57,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:10:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-08 12:10:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-09-08 12:10:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-08 12:10:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 282 transitions. [2019-09-08 12:10:57,963 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 282 transitions. Word has length 118 [2019-09-08 12:10:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:57,964 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 282 transitions. [2019-09-08 12:10:57,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:10:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 282 transitions. [2019-09-08 12:10:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:10:57,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:57,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:57,965 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash -547792204, now seen corresponding path program 1 times [2019-09-08 12:10:57,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:57,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:57,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:58,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:58,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:10:58,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:10:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:10:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:10:58,103 INFO L87 Difference]: Start difference. First operand 220 states and 282 transitions. Second operand 7 states. [2019-09-08 12:10:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:58,695 INFO L93 Difference]: Finished difference Result 608 states and 834 transitions. [2019-09-08 12:10:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:10:58,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:10:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:58,697 INFO L225 Difference]: With dead ends: 608 [2019-09-08 12:10:58,697 INFO L226 Difference]: Without dead ends: 484 [2019-09-08 12:10:58,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:10:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-08 12:10:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 252. [2019-09-08 12:10:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-08 12:10:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 325 transitions. [2019-09-08 12:10:58,815 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 325 transitions. Word has length 120 [2019-09-08 12:10:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:58,815 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 325 transitions. [2019-09-08 12:10:58,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:10:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 325 transitions. [2019-09-08 12:10:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:10:58,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:58,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:10:58,816 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash 479664936, now seen corresponding path program 1 times [2019-09-08 12:10:58,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:58,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:58,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:58,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:10:58,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:10:58,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:10:58,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:10:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:10:58,922 INFO L87 Difference]: Start difference. First operand 252 states and 325 transitions. Second operand 7 states. [2019-09-08 12:10:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:59,790 INFO L93 Difference]: Finished difference Result 980 states and 1361 transitions. [2019-09-08 12:10:59,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:10:59,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:10:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:59,793 INFO L225 Difference]: With dead ends: 980 [2019-09-08 12:10:59,793 INFO L226 Difference]: Without dead ends: 824 [2019-09-08 12:10:59,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:10:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-09-08 12:11:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 426. [2019-09-08 12:11:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 12:11:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 575 transitions. [2019-09-08 12:11:00,148 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 575 transitions. Word has length 120 [2019-09-08 12:11:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:00,149 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 575 transitions. [2019-09-08 12:11:00,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:11:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 575 transitions. [2019-09-08 12:11:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:11:00,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:00,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:00,150 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2044549086, now seen corresponding path program 1 times [2019-09-08 12:11:00,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:00,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:00,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:00,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:00,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:11:00,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:11:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:11:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:11:00,256 INFO L87 Difference]: Start difference. First operand 426 states and 575 transitions. Second operand 7 states. [2019-09-08 12:11:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:01,543 INFO L93 Difference]: Finished difference Result 1874 states and 2635 transitions. [2019-09-08 12:11:01,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:11:01,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:11:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:01,546 INFO L225 Difference]: With dead ends: 1874 [2019-09-08 12:11:01,546 INFO L226 Difference]: Without dead ends: 1544 [2019-09-08 12:11:01,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:11:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-09-08 12:11:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 794. [2019-09-08 12:11:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-09-08 12:11:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1103 transitions. [2019-09-08 12:11:02,204 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1103 transitions. Word has length 120 [2019-09-08 12:11:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:02,204 INFO L475 AbstractCegarLoop]: Abstraction has 794 states and 1103 transitions. [2019-09-08 12:11:02,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:11:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1103 transitions. [2019-09-08 12:11:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:11:02,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:02,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:02,206 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1636775367, now seen corresponding path program 1 times [2019-09-08 12:11:02,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:02,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:02,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:02,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:11:02,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:11:02,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:11:02,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:02,263 INFO L87 Difference]: Start difference. First operand 794 states and 1103 transitions. Second operand 3 states. [2019-09-08 12:11:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:02,934 INFO L93 Difference]: Finished difference Result 1858 states and 2633 transitions. [2019-09-08 12:11:02,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:11:02,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:11:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:02,937 INFO L225 Difference]: With dead ends: 1858 [2019-09-08 12:11:02,937 INFO L226 Difference]: Without dead ends: 1160 [2019-09-08 12:11:02,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-09-08 12:11:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1158. [2019-09-08 12:11:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-09-08 12:11:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1615 transitions. [2019-09-08 12:11:03,663 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1615 transitions. Word has length 120 [2019-09-08 12:11:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:03,664 INFO L475 AbstractCegarLoop]: Abstraction has 1158 states and 1615 transitions. [2019-09-08 12:11:03,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:11:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1615 transitions. [2019-09-08 12:11:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:11:03,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:03,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:03,665 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash 897035046, now seen corresponding path program 1 times [2019-09-08 12:11:03,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:03,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:03,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:03,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:03,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:11:03,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:11:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:11:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:03,717 INFO L87 Difference]: Start difference. First operand 1158 states and 1615 transitions. Second operand 3 states. [2019-09-08 12:11:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:05,007 INFO L93 Difference]: Finished difference Result 3158 states and 4445 transitions. [2019-09-08 12:11:05,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:11:05,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:11:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:05,011 INFO L225 Difference]: With dead ends: 3158 [2019-09-08 12:11:05,011 INFO L226 Difference]: Without dead ends: 2096 [2019-09-08 12:11:05,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-09-08 12:11:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2094. [2019-09-08 12:11:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-09-08 12:11:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2899 transitions. [2019-09-08 12:11:06,476 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2899 transitions. Word has length 120 [2019-09-08 12:11:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:06,476 INFO L475 AbstractCegarLoop]: Abstraction has 2094 states and 2899 transitions. [2019-09-08 12:11:06,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:11:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2899 transitions. [2019-09-08 12:11:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:11:06,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:06,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:06,479 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:06,480 INFO L82 PathProgramCache]: Analyzing trace with hash 268696988, now seen corresponding path program 1 times [2019-09-08 12:11:06,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:06,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:06,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:06,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:06,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:06,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:11:06,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:11:06,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:11:06,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:11:06,624 INFO L87 Difference]: Start difference. First operand 2094 states and 2899 transitions. Second operand 7 states. [2019-09-08 12:11:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:11,815 INFO L93 Difference]: Finished difference Result 9590 states and 13367 transitions. [2019-09-08 12:11:11,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:11:11,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:11:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:11,825 INFO L225 Difference]: With dead ends: 9590 [2019-09-08 12:11:11,826 INFO L226 Difference]: Without dead ends: 7592 [2019-09-08 12:11:11,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:11:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7592 states. [2019-09-08 12:11:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7592 to 4330. [2019-09-08 12:11:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4330 states. [2019-09-08 12:11:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6031 transitions. [2019-09-08 12:11:14,691 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6031 transitions. Word has length 120 [2019-09-08 12:11:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:14,691 INFO L475 AbstractCegarLoop]: Abstraction has 4330 states and 6031 transitions. [2019-09-08 12:11:14,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:11:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6031 transitions. [2019-09-08 12:11:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:11:14,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:14,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:14,693 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1180739922, now seen corresponding path program 1 times [2019-09-08 12:11:14,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:14,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:14,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:14,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:14,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:11:14,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:11:14,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:11:14,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:11:14,781 INFO L87 Difference]: Start difference. First operand 4330 states and 6031 transitions. Second operand 7 states. [2019-09-08 12:11:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:22,923 INFO L93 Difference]: Finished difference Result 16522 states and 23134 transitions. [2019-09-08 12:11:22,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:11:22,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:11:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:22,934 INFO L225 Difference]: With dead ends: 16522 [2019-09-08 12:11:22,934 INFO L226 Difference]: Without dead ends: 12288 [2019-09-08 12:11:22,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:11:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12288 states. [2019-09-08 12:11:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12288 to 7194. [2019-09-08 12:11:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7194 states. [2019-09-08 12:11:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7194 states to 7194 states and 10039 transitions. [2019-09-08 12:11:27,543 INFO L78 Accepts]: Start accepts. Automaton has 7194 states and 10039 transitions. Word has length 120 [2019-09-08 12:11:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:27,543 INFO L475 AbstractCegarLoop]: Abstraction has 7194 states and 10039 transitions. [2019-09-08 12:11:27,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:11:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7194 states and 10039 transitions. [2019-09-08 12:11:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:11:27,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:27,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:27,545 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:27,545 INFO L82 PathProgramCache]: Analyzing trace with hash -858738670, now seen corresponding path program 1 times [2019-09-08 12:11:27,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:27,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:27,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:27,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:27,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:27,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:11:27,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:11:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:11:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:11:27,636 INFO L87 Difference]: Start difference. First operand 7194 states and 10039 transitions. Second operand 6 states. [2019-09-08 12:11:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:35,494 INFO L93 Difference]: Finished difference Result 11903 states and 16434 transitions. [2019-09-08 12:11:35,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:11:35,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-08 12:11:35,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:35,572 INFO L225 Difference]: With dead ends: 11903 [2019-09-08 12:11:35,572 INFO L226 Difference]: Without dead ends: 11901 [2019-09-08 12:11:35,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:11:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11901 states. [2019-09-08 12:11:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11901 to 7290. [2019-09-08 12:11:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7290 states. [2019-09-08 12:11:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7290 states to 7290 states and 10103 transitions. [2019-09-08 12:11:40,325 INFO L78 Accepts]: Start accepts. Automaton has 7290 states and 10103 transitions. Word has length 121 [2019-09-08 12:11:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:40,325 INFO L475 AbstractCegarLoop]: Abstraction has 7290 states and 10103 transitions. [2019-09-08 12:11:40,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:11:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7290 states and 10103 transitions. [2019-09-08 12:11:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:11:40,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:40,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:40,330 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1840238826, now seen corresponding path program 1 times [2019-09-08 12:11:40,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:40,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:11:40,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:11:40,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:11:40,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:40,405 INFO L87 Difference]: Start difference. First operand 7290 states and 10103 transitions. Second operand 3 states. [2019-09-08 12:11:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:47,407 INFO L93 Difference]: Finished difference Result 18662 states and 26081 transitions. [2019-09-08 12:11:47,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:11:47,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:11:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:47,420 INFO L225 Difference]: With dead ends: 18662 [2019-09-08 12:11:47,420 INFO L226 Difference]: Without dead ends: 11468 [2019-09-08 12:11:47,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11468 states. [2019-09-08 12:11:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11468 to 8354. [2019-09-08 12:11:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8354 states. [2019-09-08 12:11:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8354 states to 8354 states and 11659 transitions. [2019-09-08 12:11:52,679 INFO L78 Accepts]: Start accepts. Automaton has 8354 states and 11659 transitions. Word has length 121 [2019-09-08 12:11:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:52,680 INFO L475 AbstractCegarLoop]: Abstraction has 8354 states and 11659 transitions. [2019-09-08 12:11:52,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:11:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8354 states and 11659 transitions. [2019-09-08 12:11:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:11:52,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:52,681 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:52,681 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash 570415585, now seen corresponding path program 1 times [2019-09-08 12:11:52,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:52,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:11:52,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:52,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:11:52,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:11:52,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:11:52,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:52,736 INFO L87 Difference]: Start difference. First operand 8354 states and 11659 transitions. Second operand 3 states. [2019-09-08 12:11:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:57,721 INFO L93 Difference]: Finished difference Result 15984 states and 22269 transitions. [2019-09-08 12:11:57,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:11:57,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 12:11:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:57,727 INFO L225 Difference]: With dead ends: 15984 [2019-09-08 12:11:57,728 INFO L226 Difference]: Without dead ends: 7726 [2019-09-08 12:11:57,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:11:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7726 states. [2019-09-08 12:12:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7726 to 6344. [2019-09-08 12:12:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6344 states. [2019-09-08 12:12:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6344 states to 6344 states and 8719 transitions. [2019-09-08 12:12:01,885 INFO L78 Accepts]: Start accepts. Automaton has 6344 states and 8719 transitions. Word has length 122 [2019-09-08 12:12:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:01,885 INFO L475 AbstractCegarLoop]: Abstraction has 6344 states and 8719 transitions. [2019-09-08 12:12:01,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6344 states and 8719 transitions. [2019-09-08 12:12:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:12:01,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:01,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:01,886 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1157910835, now seen corresponding path program 1 times [2019-09-08 12:12:01,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:01,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:01,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:01,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:01,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:01,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:01,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:01,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:01,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:01,960 INFO L87 Difference]: Start difference. First operand 6344 states and 8719 transitions. Second operand 3 states. [2019-09-08 12:12:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:06,787 INFO L93 Difference]: Finished difference Result 13644 states and 18777 transitions. [2019-09-08 12:12:06,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:06,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 12:12:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:06,795 INFO L225 Difference]: With dead ends: 13644 [2019-09-08 12:12:06,795 INFO L226 Difference]: Without dead ends: 7396 [2019-09-08 12:12:06,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7396 states. [2019-09-08 12:12:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7396 to 7274. [2019-09-08 12:12:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7274 states. [2019-09-08 12:12:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7274 states to 7274 states and 9949 transitions. [2019-09-08 12:12:11,641 INFO L78 Accepts]: Start accepts. Automaton has 7274 states and 9949 transitions. Word has length 123 [2019-09-08 12:12:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:11,641 INFO L475 AbstractCegarLoop]: Abstraction has 7274 states and 9949 transitions. [2019-09-08 12:12:11,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7274 states and 9949 transitions. [2019-09-08 12:12:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:12:11,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:11,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:11,642 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:11,643 INFO L82 PathProgramCache]: Analyzing trace with hash 520301820, now seen corresponding path program 1 times [2019-09-08 12:12:11,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:11,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:11,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:11,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:11,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:11,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:11,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:11,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:11,709 INFO L87 Difference]: Start difference. First operand 7274 states and 9949 transitions. Second operand 3 states. [2019-09-08 12:12:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:16,951 INFO L93 Difference]: Finished difference Result 15180 states and 20815 transitions. [2019-09-08 12:12:16,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:16,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 12:12:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:16,958 INFO L225 Difference]: With dead ends: 15180 [2019-09-08 12:12:16,958 INFO L226 Difference]: Without dead ends: 8002 [2019-09-08 12:12:16,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8002 states. [2019-09-08 12:12:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8002 to 8000. [2019-09-08 12:12:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8000 states. [2019-09-08 12:12:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8000 states to 8000 states and 10919 transitions. [2019-09-08 12:12:22,207 INFO L78 Accepts]: Start accepts. Automaton has 8000 states and 10919 transitions. Word has length 124 [2019-09-08 12:12:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:22,207 INFO L475 AbstractCegarLoop]: Abstraction has 8000 states and 10919 transitions. [2019-09-08 12:12:22,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 8000 states and 10919 transitions. [2019-09-08 12:12:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:12:22,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:22,211 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:22,211 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash -551078870, now seen corresponding path program 1 times [2019-09-08 12:12:22,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:22,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:22,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:22,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:22,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:22,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:22,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:22,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:22,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:22,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:22,283 INFO L87 Difference]: Start difference. First operand 8000 states and 10919 transitions. Second operand 3 states. [2019-09-08 12:12:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:28,991 INFO L93 Difference]: Finished difference Result 17700 states and 24113 transitions. [2019-09-08 12:12:28,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:28,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 12:12:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:29,001 INFO L225 Difference]: With dead ends: 17700 [2019-09-08 12:12:29,001 INFO L226 Difference]: Without dead ends: 9796 [2019-09-08 12:12:29,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9796 states. [2019-09-08 12:12:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9796 to 7280. [2019-09-08 12:12:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7280 states. [2019-09-08 12:12:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7280 states to 7280 states and 9767 transitions. [2019-09-08 12:12:34,158 INFO L78 Accepts]: Start accepts. Automaton has 7280 states and 9767 transitions. Word has length 155 [2019-09-08 12:12:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:34,159 INFO L475 AbstractCegarLoop]: Abstraction has 7280 states and 9767 transitions. [2019-09-08 12:12:34,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 7280 states and 9767 transitions. [2019-09-08 12:12:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 12:12:34,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:34,161 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:34,161 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash -430845502, now seen corresponding path program 1 times [2019-09-08 12:12:34,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:34,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:34,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:34,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:34,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:34,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:34,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:12:34,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:12:34,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:12:34,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:34,228 INFO L87 Difference]: Start difference. First operand 7280 states and 9767 transitions. Second operand 3 states. [2019-09-08 12:12:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:40,572 INFO L93 Difference]: Finished difference Result 16020 states and 21441 transitions. [2019-09-08 12:12:40,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:12:40,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 12:12:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:40,581 INFO L225 Difference]: With dead ends: 16020 [2019-09-08 12:12:40,581 INFO L226 Difference]: Without dead ends: 8836 [2019-09-08 12:12:40,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:12:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8836 states. [2019-09-08 12:12:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8836 to 8434. [2019-09-08 12:12:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8434 states. [2019-09-08 12:12:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8434 states to 8434 states and 11175 transitions. [2019-09-08 12:12:46,682 INFO L78 Accepts]: Start accepts. Automaton has 8434 states and 11175 transitions. Word has length 156 [2019-09-08 12:12:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:46,682 INFO L475 AbstractCegarLoop]: Abstraction has 8434 states and 11175 transitions. [2019-09-08 12:12:46,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:12:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 8434 states and 11175 transitions. [2019-09-08 12:12:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:12:46,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:46,684 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:46,685 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:46,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1504022855, now seen corresponding path program 1 times [2019-09-08 12:12:46,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:46,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:46,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:46,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:12:46,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:12:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:47,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:12:47,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:12:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 12:12:47,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:12:47,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2019-09-08 12:12:47,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:12:47,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:12:47,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:12:47,452 INFO L87 Difference]: Start difference. First operand 8434 states and 11175 transitions. Second operand 17 states. [2019-09-08 12:12:48,833 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:12:49,132 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:12:49,366 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:12:51,437 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:12:52,246 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:12:52,629 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-08 12:12:52,912 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:12:53,193 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:12:53,606 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 12:12:54,573 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:12:55,224 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:12:55,830 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:12:57,111 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:13:00,075 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:13:01,143 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:13:37,452 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-08 12:13:45,810 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:13:49,380 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:13:53,693 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:14:54,104 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:15:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:44,473 INFO L93 Difference]: Finished difference Result 204953 states and 268266 transitions. [2019-09-08 12:15:44,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-08 12:15:44,473 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 157 [2019-09-08 12:15:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:45,247 INFO L225 Difference]: With dead ends: 204953 [2019-09-08 12:15:45,248 INFO L226 Difference]: Without dead ends: 196615 [2019-09-08 12:15:45,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11710 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=5204, Invalid=23188, Unknown=0, NotChecked=0, Total=28392 [2019-09-08 12:15:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196615 states. [2019-09-08 12:16:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196615 to 32373. [2019-09-08 12:16:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32373 states. [2019-09-08 12:16:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32373 states to 32373 states and 42730 transitions. [2019-09-08 12:16:15,152 INFO L78 Accepts]: Start accepts. Automaton has 32373 states and 42730 transitions. Word has length 157 [2019-09-08 12:16:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:15,153 INFO L475 AbstractCegarLoop]: Abstraction has 32373 states and 42730 transitions. [2019-09-08 12:16:15,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:16:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 32373 states and 42730 transitions. [2019-09-08 12:16:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:16:15,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:15,162 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:15,162 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:15,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1974455249, now seen corresponding path program 1 times [2019-09-08 12:16:15,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:15,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:15,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:15,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:15,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 12:16:15,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:15,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:15,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:15,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:15,310 INFO L87 Difference]: Start difference. First operand 32373 states and 42730 transitions. Second operand 5 states. [2019-09-08 12:16:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:50,966 INFO L93 Difference]: Finished difference Result 64881 states and 85633 transitions. [2019-09-08 12:16:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:50,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 12:16:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:51,037 INFO L225 Difference]: With dead ends: 64881 [2019-09-08 12:16:51,038 INFO L226 Difference]: Without dead ends: 45163 [2019-09-08 12:16:51,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:16:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45163 states. [2019-09-08 12:17:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45163 to 38718. [2019-09-08 12:17:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-09-08 12:17:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 51134 transitions. [2019-09-08 12:17:23,893 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 51134 transitions. Word has length 157 [2019-09-08 12:17:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:23,894 INFO L475 AbstractCegarLoop]: Abstraction has 38718 states and 51134 transitions. [2019-09-08 12:17:23,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:17:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 51134 transitions. [2019-09-08 12:17:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 12:17:23,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:23,901 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:17:23,901 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:23,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:23,901 INFO L82 PathProgramCache]: Analyzing trace with hash 596309476, now seen corresponding path program 1 times [2019-09-08 12:17:23,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:23,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:23,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:23,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:23,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:17:24,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:24,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:17:24,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:17:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:17:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:24,030 INFO L87 Difference]: Start difference. First operand 38718 states and 51134 transitions. Second operand 5 states. [2019-09-08 12:18:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:06,502 INFO L93 Difference]: Finished difference Result 78501 states and 103725 transitions. [2019-09-08 12:18:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:06,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-08 12:18:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:06,566 INFO L225 Difference]: With dead ends: 78501 [2019-09-08 12:18:06,566 INFO L226 Difference]: Without dead ends: 52438 [2019-09-08 12:18:06,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:18:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52438 states. [2019-09-08 12:18:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52438 to 45063. [2019-09-08 12:18:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45063 states. [2019-09-08 12:18:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45063 states to 45063 states and 59538 transitions. [2019-09-08 12:18:43,859 INFO L78 Accepts]: Start accepts. Automaton has 45063 states and 59538 transitions. Word has length 158 [2019-09-08 12:18:43,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:43,859 INFO L475 AbstractCegarLoop]: Abstraction has 45063 states and 59538 transitions. [2019-09-08 12:18:43,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 45063 states and 59538 transitions. [2019-09-08 12:18:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 12:18:43,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:43,866 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:43,867 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash -344913878, now seen corresponding path program 1 times [2019-09-08 12:18:43,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:43,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:43,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:43,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:43,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:18:43,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:43,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:43,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:43,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:43,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:43,993 INFO L87 Difference]: Start difference. First operand 45063 states and 59538 transitions. Second operand 5 states. [2019-09-08 12:19:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:30,517 INFO L93 Difference]: Finished difference Result 90597 states and 119717 transitions. [2019-09-08 12:19:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:30,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-08 12:19:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:30,587 INFO L225 Difference]: With dead ends: 90597 [2019-09-08 12:19:30,587 INFO L226 Difference]: Without dead ends: 58189 [2019-09-08 12:19:30,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:19:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58189 states. [2019-09-08 12:20:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58189 to 51408. [2019-09-08 12:20:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51408 states. [2019-09-08 12:20:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51408 states to 51408 states and 67942 transitions. [2019-09-08 12:20:13,498 INFO L78 Accepts]: Start accepts. Automaton has 51408 states and 67942 transitions. Word has length 158 [2019-09-08 12:20:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:13,498 INFO L475 AbstractCegarLoop]: Abstraction has 51408 states and 67942 transitions. [2019-09-08 12:20:13,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:20:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 51408 states and 67942 transitions. [2019-09-08 12:20:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 12:20:13,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:13,506 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:13,506 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:13,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:13,506 INFO L82 PathProgramCache]: Analyzing trace with hash 663366430, now seen corresponding path program 1 times [2019-09-08 12:20:13,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:13,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:13,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:13,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:13,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 12:20:13,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:13,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:20:13,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:20:13,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:20:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:20:13,629 INFO L87 Difference]: Start difference. First operand 51408 states and 67942 transitions. Second operand 5 states. [2019-09-08 12:21:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:05,916 INFO L93 Difference]: Finished difference Result 104340 states and 137980 transitions. [2019-09-08 12:21:06,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:21:06,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-08 12:21:06,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:06,118 INFO L225 Difference]: With dead ends: 104340 [2019-09-08 12:21:06,118 INFO L226 Difference]: Without dead ends: 65587 [2019-09-08 12:21:06,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:21:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65587 states. [2019-09-08 12:21:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65587 to 57753. [2019-09-08 12:21:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57753 states. [2019-09-08 12:21:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57753 states to 57753 states and 76346 transitions. [2019-09-08 12:21:54,471 INFO L78 Accepts]: Start accepts. Automaton has 57753 states and 76346 transitions. Word has length 158 [2019-09-08 12:21:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:54,471 INFO L475 AbstractCegarLoop]: Abstraction has 57753 states and 76346 transitions. [2019-09-08 12:21:54,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:21:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 57753 states and 76346 transitions. [2019-09-08 12:21:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:21:54,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:54,481 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:54,481 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash 455145598, now seen corresponding path program 1 times [2019-09-08 12:21:54,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:54,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:54,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:54,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:54,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:54,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:21:54,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:21:54,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:55,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 12:21:55,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:21:55,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:21:55,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:21:55,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:21:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 12:21:55,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:21:55,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 12:21:55,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:21:55,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:21:55,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:21:55,607 INFO L87 Difference]: Start difference. First operand 57753 states and 76346 transitions. Second operand 19 states. [2019-09-08 12:21:58,285 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-09-08 12:22:02,070 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-09-08 12:22:24,627 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-08 12:22:24,814 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-08 12:22:24,989 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-08 12:22:25,177 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47