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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:12:13,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:12:13,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:12:13,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:12:13,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:12:13,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:12:13,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:12:13,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:12:13,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:12:13,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:12:13,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:12:13,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:12:13,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:12:13,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:12:13,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:12:13,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:12:13,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:12:13,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:12:13,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:12:13,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:12:13,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:12:13,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:12:13,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:12:13,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:12:13,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:12:13,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:12:13,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:12:13,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:12:13,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:12:13,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:12:13,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:12:13,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:12:13,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:12:13,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:12:13,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:12:13,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:12:13,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:12:13,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:12:13,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:12:13,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:12:13,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:12:13,457 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:12:13,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:12:13,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:12:13,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:12:13,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:12:13,487 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:12:13,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:12:13,487 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:12:13,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:12:13,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:12:13,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:12:13,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:12:13,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:12:13,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:12:13,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:12:13,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:12:13,491 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:12:13,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:12:13,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:12:13,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:12:13,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:12:13,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:12:13,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:12:13,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:12:13,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:12:13,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:12:13,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:12:13,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:12:13,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:12:13,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:12:13,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:12:13,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:12:13,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:12:13,540 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:12:13,540 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:12:13,541 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:12:13,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499ec2419/57a515ff555a4f90af2bef4f898c93a0/FLAG46d20c75c [2019-09-08 12:12:14,249 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:12:14,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:12:14,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499ec2419/57a515ff555a4f90af2bef4f898c93a0/FLAG46d20c75c [2019-09-08 12:12:14,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499ec2419/57a515ff555a4f90af2bef4f898c93a0 [2019-09-08 12:12:14,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:12:14,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:12:14,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:12:14,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:12:14,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:12:14,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:12:14" (1/1) ... [2019-09-08 12:12:14,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ec451f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:14, skipping insertion in model container [2019-09-08 12:12:14,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:12:14" (1/1) ... [2019-09-08 12:12:14,465 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:12:14,581 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:12:15,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:12:15,420 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:12:15,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:12:15,806 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:12:15,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15 WrapperNode [2019-09-08 12:12:15,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:12:15,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:12:15,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:12:15,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:12:15,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (1/1) ... [2019-09-08 12:12:15,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (1/1) ... [2019-09-08 12:12:15,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (1/1) ... [2019-09-08 12:12:15,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (1/1) ... [2019-09-08 12:12:15,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (1/1) ... [2019-09-08 12:12:15,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (1/1) ... [2019-09-08 12:12:15,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (1/1) ... [2019-09-08 12:12:15,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:12:15,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:12:15,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:12:15,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:12:15,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (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:12:16,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:12:16,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:12:16,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:12:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:12:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:12:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:12:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:12:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:12:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:12:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:12:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:12:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:12:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:12:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:12:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:12:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:12:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:12:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:12:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:12:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:12:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:12:18,384 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:12:18,384 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:12:18,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:12:18 BoogieIcfgContainer [2019-09-08 12:12:18,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:12:18,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:12:18,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:12:18,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:12:18,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:12:14" (1/3) ... [2019-09-08 12:12:18,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7947a596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:12:18, skipping insertion in model container [2019-09-08 12:12:18,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:12:15" (2/3) ... [2019-09-08 12:12:18,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7947a596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:12:18, skipping insertion in model container [2019-09-08 12:12:18,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:12:18" (3/3) ... [2019-09-08 12:12:18,396 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:12:18,407 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:12:18,415 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 12:12:18,432 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 12:12:18,482 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:12:18,483 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:12:18,483 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:12:18,483 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:12:18,483 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:12:18,483 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:12:18,484 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:12:18,484 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:12:18,484 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:12:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states. [2019-09-08 12:12:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:12:18,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:18,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,544 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash -753741321, now seen corresponding path program 1 times [2019-09-08 12:12:18,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:18,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:18,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:18,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:18,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:19,196 INFO L134 CoverageAnalysis]: 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:19,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:19,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:12:19,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:12:19,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:12:19,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:12:19,219 INFO L87 Difference]: Start difference. First operand 631 states. Second operand 5 states. [2019-09-08 12:12:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:19,865 INFO L93 Difference]: Finished difference Result 979 states and 1694 transitions. [2019-09-08 12:12:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:12:19,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 12:12:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:19,897 INFO L225 Difference]: With dead ends: 979 [2019-09-08 12:12:19,897 INFO L226 Difference]: Without dead ends: 502 [2019-09-08 12:12:19,909 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:12:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-08 12:12:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-09-08 12:12:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 12:12:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 636 transitions. [2019-09-08 12:12:20,081 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 636 transitions. Word has length 75 [2019-09-08 12:12:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:20,082 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 636 transitions. [2019-09-08 12:12:20,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:12:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 636 transitions. [2019-09-08 12:12:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:12:20,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:20,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,092 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash -4055452, now seen corresponding path program 1 times [2019-09-08 12:12:20,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:20,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:20,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:20,295 INFO L134 CoverageAnalysis]: 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:20,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:20,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:12:20,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:12:20,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:12:20,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:12:20,298 INFO L87 Difference]: Start difference. First operand 502 states and 636 transitions. Second operand 5 states. [2019-09-08 12:12:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:20,677 INFO L93 Difference]: Finished difference Result 838 states and 1091 transitions. [2019-09-08 12:12:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:12:20,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:12:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:20,681 INFO L225 Difference]: With dead ends: 838 [2019-09-08 12:12:20,681 INFO L226 Difference]: Without dead ends: 441 [2019-09-08 12:12:20,683 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:12:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-09-08 12:12:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-09-08 12:12:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-08 12:12:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 566 transitions. [2019-09-08 12:12:20,702 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 566 transitions. Word has length 76 [2019-09-08 12:12:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:20,703 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 566 transitions. [2019-09-08 12:12:20,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:12:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 566 transitions. [2019-09-08 12:12:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:12:20,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:20,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:20,706 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:20,707 INFO L82 PathProgramCache]: Analyzing trace with hash 211673049, now seen corresponding path program 1 times [2019-09-08 12:12:20,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:20,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:20,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:20,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:20,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:12:20,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:20,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:12:20,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:12:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:12:20,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:12:20,854 INFO L87 Difference]: Start difference. First operand 441 states and 566 transitions. Second operand 5 states. [2019-09-08 12:12:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:21,208 INFO L93 Difference]: Finished difference Result 777 states and 1020 transitions. [2019-09-08 12:12:21,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:12:21,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:12:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:21,212 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:12:21,213 INFO L226 Difference]: Without dead ends: 415 [2019-09-08 12:12:21,214 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:12:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-08 12:12:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2019-09-08 12:12:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-08 12:12:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 535 transitions. [2019-09-08 12:12:21,230 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 535 transitions. Word has length 77 [2019-09-08 12:12:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:21,231 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 535 transitions. [2019-09-08 12:12:21,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:12:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 535 transitions. [2019-09-08 12:12:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:12:21,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:21,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,233 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -11531761, now seen corresponding path program 1 times [2019-09-08 12:12:21,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:21,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:21,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:21,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:21,365 INFO L134 CoverageAnalysis]: 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:21,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:21,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:12:21,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:12:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:12:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:12:21,367 INFO L87 Difference]: Start difference. First operand 415 states and 535 transitions. Second operand 5 states. [2019-09-08 12:12:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:21,837 INFO L93 Difference]: Finished difference Result 751 states and 988 transitions. [2019-09-08 12:12:21,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:12:21,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 12:12:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:21,840 INFO L225 Difference]: With dead ends: 751 [2019-09-08 12:12:21,841 INFO L226 Difference]: Without dead ends: 405 [2019-09-08 12:12:21,842 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:12:21,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-08 12:12:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2019-09-08 12:12:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-08 12:12:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 522 transitions. [2019-09-08 12:12:21,858 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 522 transitions. Word has length 78 [2019-09-08 12:12:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:21,859 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 522 transitions. [2019-09-08 12:12:21,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:12:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 522 transitions. [2019-09-08 12:12:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:12:21,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:21,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:21,862 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:21,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1775015611, now seen corresponding path program 1 times [2019-09-08 12:12:21,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:21,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:21,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:21,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:21,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:12:21,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:12:21,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:12:21,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:12:21,961 INFO L87 Difference]: Start difference. First operand 405 states and 522 transitions. Second operand 5 states. [2019-09-08 12:12:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:22,255 INFO L93 Difference]: Finished difference Result 741 states and 974 transitions. [2019-09-08 12:12:22,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:12:22,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-08 12:12:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:22,258 INFO L225 Difference]: With dead ends: 741 [2019-09-08 12:12:22,259 INFO L226 Difference]: Without dead ends: 394 [2019-09-08 12:12:22,260 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:12:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-08 12:12:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2019-09-08 12:12:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 509 transitions. [2019-09-08 12:12:22,278 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 509 transitions. Word has length 79 [2019-09-08 12:12:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:22,278 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 509 transitions. [2019-09-08 12:12:22,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:12:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 509 transitions. [2019-09-08 12:12:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:12:22,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:22,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,281 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1857846520, now seen corresponding path program 1 times [2019-09-08 12:12:22,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:22,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:22,527 INFO L134 CoverageAnalysis]: 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:22,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:22,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:22,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:22,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:22,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:22,529 INFO L87 Difference]: Start difference. First operand 394 states and 509 transitions. Second operand 9 states. [2019-09-08 12:12:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:23,915 INFO L93 Difference]: Finished difference Result 824 states and 1109 transitions. [2019-09-08 12:12:23,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:23,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 12:12:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:23,920 INFO L225 Difference]: With dead ends: 824 [2019-09-08 12:12:23,920 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 12:12:23,921 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:12:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 12:12:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-08 12:12:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 508 transitions. [2019-09-08 12:12:23,946 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 508 transitions. Word has length 80 [2019-09-08 12:12:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:23,947 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 508 transitions. [2019-09-08 12:12:23,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2019-09-08 12:12:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:12:23,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:23,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:23,949 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1356435279, now seen corresponding path program 1 times [2019-09-08 12:12:23,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:23,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:23,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:24,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:24,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:24,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:24,128 INFO L87 Difference]: Start difference. First operand 394 states and 508 transitions. Second operand 9 states. [2019-09-08 12:12:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:25,313 INFO L93 Difference]: Finished difference Result 867 states and 1163 transitions. [2019-09-08 12:12:25,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:25,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 12:12:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:25,318 INFO L225 Difference]: With dead ends: 867 [2019-09-08 12:12:25,318 INFO L226 Difference]: Without dead ends: 739 [2019-09-08 12:12:25,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:12:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-08 12:12:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2019-09-08 12:12:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 507 transitions. [2019-09-08 12:12:25,346 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 507 transitions. Word has length 80 [2019-09-08 12:12:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:25,347 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 507 transitions. [2019-09-08 12:12:25,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 507 transitions. [2019-09-08 12:12:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:12:25,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:25,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,349 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:25,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:25,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1849417194, now seen corresponding path program 1 times [2019-09-08 12:12:25,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:25,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:25,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:25,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:12:25,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:12:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:12:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:12:25,501 INFO L87 Difference]: Start difference. First operand 394 states and 507 transitions. Second operand 8 states. [2019-09-08 12:12:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:26,201 INFO L93 Difference]: Finished difference Result 758 states and 964 transitions. [2019-09-08 12:12:26,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:12:26,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-09-08 12:12:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:26,205 INFO L225 Difference]: With dead ends: 758 [2019-09-08 12:12:26,206 INFO L226 Difference]: Without dead ends: 546 [2019-09-08 12:12:26,207 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:12:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-08 12:12:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 394. [2019-09-08 12:12:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 506 transitions. [2019-09-08 12:12:26,235 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 506 transitions. Word has length 80 [2019-09-08 12:12:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:26,236 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 506 transitions. [2019-09-08 12:12:26,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:12:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 506 transitions. [2019-09-08 12:12:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:12:26,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:26,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,238 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:26,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1030150032, now seen corresponding path program 1 times [2019-09-08 12:12:26,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:26,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:26,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:26,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:26,414 INFO L87 Difference]: Start difference. First operand 394 states and 506 transitions. Second operand 9 states. [2019-09-08 12:12:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:27,818 INFO L93 Difference]: Finished difference Result 803 states and 1071 transitions. [2019-09-08 12:12:27,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:27,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:12:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:27,823 INFO L225 Difference]: With dead ends: 803 [2019-09-08 12:12:27,823 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:12:27,824 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:12:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:12:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:12:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 505 transitions. [2019-09-08 12:12:27,850 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 505 transitions. Word has length 82 [2019-09-08 12:12:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:27,850 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 505 transitions. [2019-09-08 12:12:27,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2019-09-08 12:12:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:12:27,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:27,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:27,852 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:27,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1206210007, now seen corresponding path program 1 times [2019-09-08 12:12:27,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:27,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:28,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:28,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:28,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:28,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:28,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:28,007 INFO L87 Difference]: Start difference. First operand 394 states and 505 transitions. Second operand 9 states. [2019-09-08 12:12:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:29,499 INFO L93 Difference]: Finished difference Result 833 states and 1113 transitions. [2019-09-08 12:12:29,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:29,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:12:29,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:29,505 INFO L225 Difference]: With dead ends: 833 [2019-09-08 12:12:29,508 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 12:12:29,509 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:12:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 12:12:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-08 12:12:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 504 transitions. [2019-09-08 12:12:29,557 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 504 transitions. Word has length 82 [2019-09-08 12:12:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:29,557 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 504 transitions. [2019-09-08 12:12:29,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 504 transitions. [2019-09-08 12:12:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:12:29,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:29,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,562 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2075347116, now seen corresponding path program 1 times [2019-09-08 12:12:29,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:29,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:29,832 INFO L134 CoverageAnalysis]: 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:29,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:29,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:29,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:29,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:29,834 INFO L87 Difference]: Start difference. First operand 394 states and 504 transitions. Second operand 9 states. [2019-09-08 12:12:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:31,318 INFO L93 Difference]: Finished difference Result 799 states and 1065 transitions. [2019-09-08 12:12:31,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:31,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:12:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:31,324 INFO L225 Difference]: With dead ends: 799 [2019-09-08 12:12:31,324 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:12:31,325 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:12:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:12:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:12:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 503 transitions. [2019-09-08 12:12:31,353 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 503 transitions. Word has length 82 [2019-09-08 12:12:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:31,353 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 503 transitions. [2019-09-08 12:12:31,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 503 transitions. [2019-09-08 12:12:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:12:31,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:31,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,355 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:31,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:31,356 INFO L82 PathProgramCache]: Analyzing trace with hash -147519972, now seen corresponding path program 1 times [2019-09-08 12:12:31,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:31,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:31,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:31,510 INFO L134 CoverageAnalysis]: 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:31,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:31,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:31,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:31,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:31,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:31,512 INFO L87 Difference]: Start difference. First operand 394 states and 503 transitions. Second operand 9 states. [2019-09-08 12:12:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:32,988 INFO L93 Difference]: Finished difference Result 803 states and 1067 transitions. [2019-09-08 12:12:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:32,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:12:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:32,993 INFO L225 Difference]: With dead ends: 803 [2019-09-08 12:12:32,993 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:12:32,994 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:12:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:12:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:12:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 502 transitions. [2019-09-08 12:12:33,027 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 502 transitions. Word has length 82 [2019-09-08 12:12:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:33,027 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 502 transitions. [2019-09-08 12:12:33,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2019-09-08 12:12:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:12:33,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:33,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,030 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1924278388, now seen corresponding path program 1 times [2019-09-08 12:12:33,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:33,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:33,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:33,202 INFO L134 CoverageAnalysis]: 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:33,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:33,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:33,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:33,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:33,204 INFO L87 Difference]: Start difference. First operand 394 states and 502 transitions. Second operand 9 states. [2019-09-08 12:12:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:34,621 INFO L93 Difference]: Finished difference Result 803 states and 1065 transitions. [2019-09-08 12:12:34,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:34,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:12:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:34,627 INFO L225 Difference]: With dead ends: 803 [2019-09-08 12:12:34,627 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:12:34,628 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:12:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:12:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:12:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 501 transitions. [2019-09-08 12:12:34,656 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 501 transitions. Word has length 82 [2019-09-08 12:12:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:34,656 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 501 transitions. [2019-09-08 12:12:34,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 501 transitions. [2019-09-08 12:12:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:12:34,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:34,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:34,658 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1020669943, now seen corresponding path program 1 times [2019-09-08 12:12:34,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:34,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:34,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:34,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:34,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:34,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:34,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:34,798 INFO L87 Difference]: Start difference. First operand 394 states and 501 transitions. Second operand 9 states. [2019-09-08 12:12:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:36,165 INFO L93 Difference]: Finished difference Result 833 states and 1106 transitions. [2019-09-08 12:12:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:36,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:12:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:36,168 INFO L225 Difference]: With dead ends: 833 [2019-09-08 12:12:36,168 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 12:12:36,169 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:12:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 12:12:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-08 12:12:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2019-09-08 12:12:36,201 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 82 [2019-09-08 12:12:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:36,202 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2019-09-08 12:12:36,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2019-09-08 12:12:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:12:36,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:36,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,204 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1567452331, now seen corresponding path program 1 times [2019-09-08 12:12:36,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:36,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:36,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:36,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:36,349 INFO L134 CoverageAnalysis]: 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:36,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:36,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:36,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:36,351 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand 9 states. [2019-09-08 12:12:37,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:37,729 INFO L93 Difference]: Finished difference Result 882 states and 1166 transitions. [2019-09-08 12:12:37,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:37,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:12:37,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:37,732 INFO L225 Difference]: With dead ends: 882 [2019-09-08 12:12:37,733 INFO L226 Difference]: Without dead ends: 739 [2019-09-08 12:12:37,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:12:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-08 12:12:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2019-09-08 12:12:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 499 transitions. [2019-09-08 12:12:37,765 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 499 transitions. Word has length 82 [2019-09-08 12:12:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:37,765 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 499 transitions. [2019-09-08 12:12:37,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 499 transitions. [2019-09-08 12:12:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:37,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:37,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] [2019-09-08 12:12:37,767 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1772826454, now seen corresponding path program 1 times [2019-09-08 12:12:37,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:37,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:37,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:37,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:37,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:37,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:37,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:37,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:37,915 INFO L87 Difference]: Start difference. First operand 394 states and 499 transitions. Second operand 9 states. [2019-09-08 12:12:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:39,256 INFO L93 Difference]: Finished difference Result 780 states and 1026 transitions. [2019-09-08 12:12:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:39,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:39,259 INFO L225 Difference]: With dead ends: 780 [2019-09-08 12:12:39,260 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:39,261 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:12:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2019-09-08 12:12:39,298 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 84 [2019-09-08 12:12:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:39,298 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2019-09-08 12:12:39,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2019-09-08 12:12:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:39,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:39,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,300 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash 156330058, now seen corresponding path program 1 times [2019-09-08 12:12:39,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:39,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:39,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:39,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:39,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:39,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:39,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:39,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:39,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:39,468 INFO L87 Difference]: Start difference. First operand 394 states and 498 transitions. Second operand 9 states. [2019-09-08 12:12:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:40,955 INFO L93 Difference]: Finished difference Result 808 states and 1065 transitions. [2019-09-08 12:12:40,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:40,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:40,959 INFO L225 Difference]: With dead ends: 808 [2019-09-08 12:12:40,959 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:12:40,960 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:12:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:12:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:12:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2019-09-08 12:12:40,995 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 84 [2019-09-08 12:12:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:40,995 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2019-09-08 12:12:40,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2019-09-08 12:12:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:40,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:40,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,997 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash -808913805, now seen corresponding path program 1 times [2019-09-08 12:12:40,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:40,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:41,158 INFO L134 CoverageAnalysis]: 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:41,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:41,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:41,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:41,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:41,160 INFO L87 Difference]: Start difference. First operand 394 states and 497 transitions. Second operand 9 states. [2019-09-08 12:12:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:42,591 INFO L93 Difference]: Finished difference Result 777 states and 1021 transitions. [2019-09-08 12:12:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:42,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:42,595 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:12:42,596 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:42,596 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:12:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2019-09-08 12:12:42,626 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 84 [2019-09-08 12:12:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:42,626 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2019-09-08 12:12:42,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2019-09-08 12:12:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:42,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:42,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,628 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:42,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1360926238, now seen corresponding path program 1 times [2019-09-08 12:12:42,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:42,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:42,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:42,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:42,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:42,813 INFO L134 CoverageAnalysis]: 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:42,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:42,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:42,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:42,815 INFO L87 Difference]: Start difference. First operand 394 states and 496 transitions. Second operand 9 states. [2019-09-08 12:12:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:44,283 INFO L93 Difference]: Finished difference Result 780 states and 1023 transitions. [2019-09-08 12:12:44,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:44,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:44,286 INFO L225 Difference]: With dead ends: 780 [2019-09-08 12:12:44,286 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:44,287 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:12:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 495 transitions. [2019-09-08 12:12:44,325 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 495 transitions. Word has length 84 [2019-09-08 12:12:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:44,326 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 495 transitions. [2019-09-08 12:12:44,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 495 transitions. [2019-09-08 12:12:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:44,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:44,327 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,328 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:44,328 INFO L82 PathProgramCache]: Analyzing trace with hash -948259243, now seen corresponding path program 1 times [2019-09-08 12:12:44,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:44,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:44,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:44,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:44,464 INFO L134 CoverageAnalysis]: 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:44,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:44,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:44,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:44,465 INFO L87 Difference]: Start difference. First operand 394 states and 495 transitions. Second operand 9 states. [2019-09-08 12:12:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:45,937 INFO L93 Difference]: Finished difference Result 777 states and 1018 transitions. [2019-09-08 12:12:45,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:45,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:45,940 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:12:45,941 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:45,941 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:12:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 494 transitions. [2019-09-08 12:12:46,005 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 494 transitions. Word has length 84 [2019-09-08 12:12:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:46,005 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 494 transitions. [2019-09-08 12:12:46,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 494 transitions. [2019-09-08 12:12:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:46,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:46,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,007 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1254134787, now seen corresponding path program 1 times [2019-09-08 12:12:46,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:46,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:46,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:46,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:46,157 INFO L134 CoverageAnalysis]: 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:46,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:46,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:46,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:46,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:46,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:46,159 INFO L87 Difference]: Start difference. First operand 394 states and 494 transitions. Second operand 9 states. [2019-09-08 12:12:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:47,470 INFO L93 Difference]: Finished difference Result 775 states and 1014 transitions. [2019-09-08 12:12:47,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:47,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:47,473 INFO L225 Difference]: With dead ends: 775 [2019-09-08 12:12:47,474 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:47,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:12:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 493 transitions. [2019-09-08 12:12:47,505 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 493 transitions. Word has length 84 [2019-09-08 12:12:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:47,505 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 493 transitions. [2019-09-08 12:12:47,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 493 transitions. [2019-09-08 12:12:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:47,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:47,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:47,507 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1128458993, now seen corresponding path program 1 times [2019-09-08 12:12:47,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:47,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:47,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:47,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:47,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:47,652 INFO L134 CoverageAnalysis]: 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:47,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:47,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:47,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:47,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:47,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:47,654 INFO L87 Difference]: Start difference. First operand 394 states and 493 transitions. Second operand 9 states. [2019-09-08 12:12:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:48,977 INFO L93 Difference]: Finished difference Result 777 states and 1015 transitions. [2019-09-08 12:12:48,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:48,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:48,985 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:12:48,985 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:48,986 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:12:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 492 transitions. [2019-09-08 12:12:49,035 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 492 transitions. Word has length 84 [2019-09-08 12:12:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:49,035 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 492 transitions. [2019-09-08 12:12:49,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 492 transitions. [2019-09-08 12:12:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:49,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:49,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,037 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash -145040535, now seen corresponding path program 1 times [2019-09-08 12:12:49,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:49,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:49,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:49,167 INFO L134 CoverageAnalysis]: 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:49,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:49,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:49,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:49,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:49,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:49,168 INFO L87 Difference]: Start difference. First operand 394 states and 492 transitions. Second operand 9 states. [2019-09-08 12:12:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:50,599 INFO L93 Difference]: Finished difference Result 716 states and 921 transitions. [2019-09-08 12:12:50,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:50,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:50,603 INFO L225 Difference]: With dead ends: 716 [2019-09-08 12:12:50,603 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:50,603 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:12:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 491 transitions. [2019-09-08 12:12:50,647 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 491 transitions. Word has length 84 [2019-09-08 12:12:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:50,647 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 491 transitions. [2019-09-08 12:12:50,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 491 transitions. [2019-09-08 12:12:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:50,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:50,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,649 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:50,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:50,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1972694375, now seen corresponding path program 1 times [2019-09-08 12:12:50,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:50,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:50,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:50,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:50,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:50,787 INFO L134 CoverageAnalysis]: 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:50,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:50,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:50,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:50,790 INFO L87 Difference]: Start difference. First operand 394 states and 491 transitions. Second operand 9 states. [2019-09-08 12:12:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:52,105 INFO L93 Difference]: Finished difference Result 716 states and 919 transitions. [2019-09-08 12:12:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:52,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:52,110 INFO L225 Difference]: With dead ends: 716 [2019-09-08 12:12:52,110 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:52,111 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:12:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 490 transitions. [2019-09-08 12:12:52,175 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 490 transitions. Word has length 84 [2019-09-08 12:12:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:52,176 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 490 transitions. [2019-09-08 12:12:52,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 490 transitions. [2019-09-08 12:12:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:52,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:52,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,177 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1587646214, now seen corresponding path program 1 times [2019-09-08 12:12:52,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:52,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:52,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:52,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:52,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:12:52,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:52,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:52,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:52,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:52,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:52,313 INFO L87 Difference]: Start difference. First operand 394 states and 490 transitions. Second operand 9 states. [2019-09-08 12:12:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:53,735 INFO L93 Difference]: Finished difference Result 744 states and 957 transitions. [2019-09-08 12:12:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:53,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:53,739 INFO L225 Difference]: With dead ends: 744 [2019-09-08 12:12:53,739 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:12:53,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:12:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:12:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:12:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2019-09-08 12:12:53,773 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 84 [2019-09-08 12:12:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:53,773 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2019-09-08 12:12:53,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2019-09-08 12:12:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:53,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:53,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:53,775 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:53,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1234023999, now seen corresponding path program 1 times [2019-09-08 12:12:53,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:53,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:53,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:53,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:53,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:53,907 INFO L134 CoverageAnalysis]: 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:53,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:53,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:53,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:53,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:53,908 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 9 states. [2019-09-08 12:12:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:55,242 INFO L93 Difference]: Finished difference Result 777 states and 1010 transitions. [2019-09-08 12:12:55,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:55,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:55,246 INFO L225 Difference]: With dead ends: 777 [2019-09-08 12:12:55,246 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:55,247 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:12:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 488 transitions. [2019-09-08 12:12:55,308 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 488 transitions. Word has length 84 [2019-09-08 12:12:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:55,309 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 488 transitions. [2019-09-08 12:12:55,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 488 transitions. [2019-09-08 12:12:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:55,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:55,310 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,310 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1787094233, now seen corresponding path program 1 times [2019-09-08 12:12:55,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:55,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:55,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:55,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:55,468 INFO L134 CoverageAnalysis]: 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:55,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:55,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:55,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:55,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:55,470 INFO L87 Difference]: Start difference. First operand 394 states and 488 transitions. Second operand 9 states. [2019-09-08 12:12:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:56,851 INFO L93 Difference]: Finished difference Result 716 states and 916 transitions. [2019-09-08 12:12:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:56,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:56,854 INFO L225 Difference]: With dead ends: 716 [2019-09-08 12:12:56,854 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:56,854 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:12:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 487 transitions. [2019-09-08 12:12:56,890 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 487 transitions. Word has length 84 [2019-09-08 12:12:56,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:56,890 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 487 transitions. [2019-09-08 12:12:56,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 487 transitions. [2019-09-08 12:12:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:56,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:56,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,892 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1753371594, now seen corresponding path program 1 times [2019-09-08 12:12:56,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:56,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:56,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:56,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:56,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:57,028 INFO L134 CoverageAnalysis]: 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:57,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:57,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:57,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:57,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:57,029 INFO L87 Difference]: Start difference. First operand 394 states and 487 transitions. Second operand 9 states. [2019-09-08 12:12:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:58,270 INFO L93 Difference]: Finished difference Result 808 states and 1049 transitions. [2019-09-08 12:12:58,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:58,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:58,273 INFO L225 Difference]: With dead ends: 808 [2019-09-08 12:12:58,273 INFO L226 Difference]: Without dead ends: 727 [2019-09-08 12:12:58,273 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:12:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-08 12:12:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-08 12:12:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 486 transitions. [2019-09-08 12:12:58,307 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 486 transitions. Word has length 84 [2019-09-08 12:12:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:58,307 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 486 transitions. [2019-09-08 12:12:58,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 486 transitions. [2019-09-08 12:12:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:58,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:58,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,309 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:58,309 INFO L82 PathProgramCache]: Analyzing trace with hash -175784918, now seen corresponding path program 1 times [2019-09-08 12:12:58,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:58,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:58,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:58,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:58,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:58,456 INFO L134 CoverageAnalysis]: 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:58,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:58,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:58,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:58,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:58,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:58,481 INFO L87 Difference]: Start difference. First operand 394 states and 486 transitions. Second operand 9 states. [2019-09-08 12:12:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:12:59,790 INFO L93 Difference]: Finished difference Result 780 states and 1009 transitions. [2019-09-08 12:12:59,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:12:59,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:12:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:12:59,794 INFO L225 Difference]: With dead ends: 780 [2019-09-08 12:12:59,794 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 12:12:59,794 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:12:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 12:12:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-08 12:12:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:12:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 485 transitions. [2019-09-08 12:12:59,842 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 485 transitions. Word has length 84 [2019-09-08 12:12:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:12:59,843 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 485 transitions. [2019-09-08 12:12:59,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:12:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 485 transitions. [2019-09-08 12:12:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:12:59,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:12:59,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:12:59,844 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:12:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:12:59,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1958628796, now seen corresponding path program 1 times [2019-09-08 12:12:59,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:12:59,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:12:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:59,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:12:59,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:12:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:12:59,971 INFO L134 CoverageAnalysis]: 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:59,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:12:59,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:12:59,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:12:59,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:12:59,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:12:59,973 INFO L87 Difference]: Start difference. First operand 394 states and 485 transitions. Second operand 9 states. [2019-09-08 12:13:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:01,484 INFO L93 Difference]: Finished difference Result 839 states and 1091 transitions. [2019-09-08 12:13:01,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:13:01,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:13:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:01,488 INFO L225 Difference]: With dead ends: 839 [2019-09-08 12:13:01,488 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 12:13:01,489 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:13:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 12:13:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-08 12:13:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 12:13:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 484 transitions. [2019-09-08 12:13:01,520 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 484 transitions. Word has length 84 [2019-09-08 12:13:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:01,521 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 484 transitions. [2019-09-08 12:13:01,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:13:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 484 transitions. [2019-09-08 12:13:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:13:01,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:01,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:01,523 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:01,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:01,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1126502043, now seen corresponding path program 1 times [2019-09-08 12:13:01,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:01,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:01,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:03,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:03,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:13:03,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:13:03,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:13:03,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:13:03,089 INFO L87 Difference]: Start difference. First operand 394 states and 484 transitions. Second operand 25 states. [2019-09-08 12:13:04,025 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-08 12:13:04,294 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-08 12:13:04,545 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2019-09-08 12:13:04,831 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73 [2019-09-08 12:13:05,033 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 12:13:05,221 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 12:13:05,398 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-08 12:13:05,573 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-08 12:13:05,766 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-08 12:13:05,992 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-08 12:13:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:10,050 INFO L93 Difference]: Finished difference Result 886 states and 1124 transitions. [2019-09-08 12:13:10,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:13:10,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2019-09-08 12:13:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:10,056 INFO L225 Difference]: With dead ends: 886 [2019-09-08 12:13:10,056 INFO L226 Difference]: Without dead ends: 793 [2019-09-08 12:13:10,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:13:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-09-08 12:13:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 405. [2019-09-08 12:13:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-08 12:13:10,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 496 transitions. [2019-09-08 12:13:10,118 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 496 transitions. Word has length 86 [2019-09-08 12:13:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:10,118 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 496 transitions. [2019-09-08 12:13:10,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:13:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 496 transitions. [2019-09-08 12:13:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:13:10,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:10,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:10,120 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:10,121 INFO L82 PathProgramCache]: Analyzing trace with hash 863263109, now seen corresponding path program 1 times [2019-09-08 12:13:10,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:10,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:10,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:10,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:10,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:10,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:13:10,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:13:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:13:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:13:10,667 INFO L87 Difference]: Start difference. First operand 405 states and 496 transitions. Second operand 15 states. [2019-09-08 12:13:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:12,544 INFO L93 Difference]: Finished difference Result 893 states and 1148 transitions. [2019-09-08 12:13:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:13:12,549 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-09-08 12:13:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:12,553 INFO L225 Difference]: With dead ends: 893 [2019-09-08 12:13:12,553 INFO L226 Difference]: Without dead ends: 710 [2019-09-08 12:13:12,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:13:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-08 12:13:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 346. [2019-09-08 12:13:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-08 12:13:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 421 transitions. [2019-09-08 12:13:12,612 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 421 transitions. Word has length 86 [2019-09-08 12:13:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:12,613 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 421 transitions. [2019-09-08 12:13:12,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:13:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 421 transitions. [2019-09-08 12:13:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:13:12,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:12,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:12,614 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash 679846051, now seen corresponding path program 1 times [2019-09-08 12:13:12,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:12,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:12,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:13,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:13,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:13:13,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:13:13,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:13:13,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:13:13,288 INFO L87 Difference]: Start difference. First operand 346 states and 421 transitions. Second operand 16 states. [2019-09-08 12:13:13,840 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:13:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:15,593 INFO L93 Difference]: Finished difference Result 645 states and 775 transitions. [2019-09-08 12:13:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:13:15,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-08 12:13:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:15,596 INFO L225 Difference]: With dead ends: 645 [2019-09-08 12:13:15,596 INFO L226 Difference]: Without dead ends: 641 [2019-09-08 12:13:15,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:13:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-08 12:13:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 368. [2019-09-08 12:13:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-08 12:13:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 451 transitions. [2019-09-08 12:13:15,667 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 451 transitions. Word has length 86 [2019-09-08 12:13:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:15,667 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 451 transitions. [2019-09-08 12:13:15,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:13:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 451 transitions. [2019-09-08 12:13:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:13:15,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:15,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:15,669 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:15,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2034960557, now seen corresponding path program 1 times [2019-09-08 12:13:15,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:15,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:15,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:15,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:15,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:16,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:16,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:13:16,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:13:16,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:13:16,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:13:16,329 INFO L87 Difference]: Start difference. First operand 368 states and 451 transitions. Second operand 17 states. [2019-09-08 12:13:16,846 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:13:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:18,394 INFO L93 Difference]: Finished difference Result 773 states and 1003 transitions. [2019-09-08 12:13:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:13:18,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-08 12:13:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:18,397 INFO L225 Difference]: With dead ends: 773 [2019-09-08 12:13:18,397 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 12:13:18,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:13:18,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 12:13:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 344. [2019-09-08 12:13:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-08 12:13:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 418 transitions. [2019-09-08 12:13:18,452 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 418 transitions. Word has length 86 [2019-09-08 12:13:18,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:18,452 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 418 transitions. [2019-09-08 12:13:18,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:13:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 418 transitions. [2019-09-08 12:13:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:13:18,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:18,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:18,454 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:18,454 INFO L82 PathProgramCache]: Analyzing trace with hash 327077445, now seen corresponding path program 1 times [2019-09-08 12:13:18,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:18,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:18,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:13:19,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:13:19,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:13:19,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:13:19,125 INFO L87 Difference]: Start difference. First operand 344 states and 418 transitions. Second operand 17 states. [2019-09-08 12:13:19,741 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:13:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:21,316 INFO L93 Difference]: Finished difference Result 725 states and 944 transitions. [2019-09-08 12:13:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:13:21,316 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-08 12:13:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:21,318 INFO L225 Difference]: With dead ends: 725 [2019-09-08 12:13:21,318 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 12:13:21,319 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:13:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 12:13:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 333. [2019-09-08 12:13:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 12:13:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 403 transitions. [2019-09-08 12:13:21,367 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 403 transitions. Word has length 86 [2019-09-08 12:13:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:21,367 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 403 transitions. [2019-09-08 12:13:21,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:13:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 403 transitions. [2019-09-08 12:13:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:13:21,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:21,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:21,369 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:21,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1178808939, now seen corresponding path program 1 times [2019-09-08 12:13:21,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:21,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:21,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:21,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:21,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:22,314 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:13:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:23,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:23,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:13:23,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:13:23,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:13:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:13:23,189 INFO L87 Difference]: Start difference. First operand 333 states and 403 transitions. Second operand 26 states. [2019-09-08 12:13:23,322 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:13:24,246 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 12:13:24,460 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-08 12:13:24,717 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-08 12:13:25,080 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2019-09-08 12:13:25,291 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 12:13:25,501 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 12:13:25,723 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-08 12:13:27,938 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 12:13:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:28,851 INFO L93 Difference]: Finished difference Result 664 states and 821 transitions. [2019-09-08 12:13:28,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:13:28,851 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2019-09-08 12:13:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:28,854 INFO L225 Difference]: With dead ends: 664 [2019-09-08 12:13:28,854 INFO L226 Difference]: Without dead ends: 596 [2019-09-08 12:13:28,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 12:13:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-08 12:13:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 348. [2019-09-08 12:13:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-08 12:13:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 424 transitions. [2019-09-08 12:13:28,946 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 424 transitions. Word has length 86 [2019-09-08 12:13:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:28,947 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 424 transitions. [2019-09-08 12:13:28,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:13:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 424 transitions. [2019-09-08 12:13:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:13:28,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:28,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:28,948 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1246040559, now seen corresponding path program 1 times [2019-09-08 12:13:28,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:28,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:28,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:29,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:29,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:13:29,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:13:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:13:29,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:13:29,411 INFO L87 Difference]: Start difference. First operand 348 states and 424 transitions. Second operand 12 states. [2019-09-08 12:13:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:30,662 INFO L93 Difference]: Finished difference Result 562 states and 707 transitions. [2019-09-08 12:13:30,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:13:30,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-08 12:13:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:30,665 INFO L225 Difference]: With dead ends: 562 [2019-09-08 12:13:30,665 INFO L226 Difference]: Without dead ends: 494 [2019-09-08 12:13:30,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:13:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-08 12:13:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 344. [2019-09-08 12:13:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-08 12:13:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 419 transitions. [2019-09-08 12:13:30,722 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 419 transitions. Word has length 87 [2019-09-08 12:13:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:30,722 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 419 transitions. [2019-09-08 12:13:30,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:13:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 419 transitions. [2019-09-08 12:13:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:13:30,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:30,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:30,723 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1482173800, now seen corresponding path program 1 times [2019-09-08 12:13:30,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:30,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:30,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:31,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:31,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:13:31,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:13:31,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:13:31,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:13:31,341 INFO L87 Difference]: Start difference. First operand 344 states and 419 transitions. Second operand 17 states. [2019-09-08 12:13:31,888 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:13:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:33,809 INFO L93 Difference]: Finished difference Result 717 states and 933 transitions. [2019-09-08 12:13:33,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:13:33,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 12:13:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:33,811 INFO L225 Difference]: With dead ends: 717 [2019-09-08 12:13:33,811 INFO L226 Difference]: Without dead ends: 646 [2019-09-08 12:13:33,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:13:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-08 12:13:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 343. [2019-09-08 12:13:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 12:13:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 416 transitions. [2019-09-08 12:13:33,874 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 416 transitions. Word has length 87 [2019-09-08 12:13:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:33,875 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 416 transitions. [2019-09-08 12:13:33,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:13:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 416 transitions. [2019-09-08 12:13:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:13:33,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:33,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:33,876 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1059161585, now seen corresponding path program 1 times [2019-09-08 12:13:33,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:33,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:33,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:34,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:34,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:13:34,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:13:34,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:13:34,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:13:34,172 INFO L87 Difference]: Start difference. First operand 343 states and 416 transitions. Second operand 11 states. [2019-09-08 12:13:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:34,948 INFO L93 Difference]: Finished difference Result 826 states and 1099 transitions. [2019-09-08 12:13:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:13:34,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-08 12:13:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:34,953 INFO L225 Difference]: With dead ends: 826 [2019-09-08 12:13:34,953 INFO L226 Difference]: Without dead ends: 738 [2019-09-08 12:13:34,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:13:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-08 12:13:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 319. [2019-09-08 12:13:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 12:13:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 385 transitions. [2019-09-08 12:13:35,036 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 385 transitions. Word has length 87 [2019-09-08 12:13:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:35,036 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 385 transitions. [2019-09-08 12:13:35,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:13:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 385 transitions. [2019-09-08 12:13:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:13:35,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:35,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:35,038 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1860216222, now seen corresponding path program 1 times [2019-09-08 12:13:35,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:35,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:35,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:35,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:35,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:35,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:35,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:13:35,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:13:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:13:35,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:13:35,406 INFO L87 Difference]: Start difference. First operand 319 states and 385 transitions. Second operand 12 states. [2019-09-08 12:13:35,842 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 12:13:35,981 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 12:13:36,191 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-08 12:13:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:36,908 INFO L93 Difference]: Finished difference Result 796 states and 1060 transitions. [2019-09-08 12:13:36,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:13:36,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-08 12:13:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:36,911 INFO L225 Difference]: With dead ends: 796 [2019-09-08 12:13:36,911 INFO L226 Difference]: Without dead ends: 712 [2019-09-08 12:13:36,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:13:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-08 12:13:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 288. [2019-09-08 12:13:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-08 12:13:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 345 transitions. [2019-09-08 12:13:36,966 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 345 transitions. Word has length 87 [2019-09-08 12:13:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:36,966 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 345 transitions. [2019-09-08 12:13:36,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:13:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 345 transitions. [2019-09-08 12:13:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:13:36,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:36,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:36,968 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1944199773, now seen corresponding path program 1 times [2019-09-08 12:13:36,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:36,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:36,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:36,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:37,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:37,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:13:37,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:13:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:13:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:13:37,497 INFO L87 Difference]: Start difference. First operand 288 states and 345 transitions. Second operand 13 states. [2019-09-08 12:13:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:38,697 INFO L93 Difference]: Finished difference Result 689 states and 886 transitions. [2019-09-08 12:13:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:13:38,698 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-09-08 12:13:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:38,700 INFO L225 Difference]: With dead ends: 689 [2019-09-08 12:13:38,700 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 12:13:38,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:13:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 12:13:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 277. [2019-09-08 12:13:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-08 12:13:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2019-09-08 12:13:38,759 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 87 [2019-09-08 12:13:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:38,759 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2019-09-08 12:13:38,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:13:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2019-09-08 12:13:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:13:38,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:38,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:38,760 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1585662154, now seen corresponding path program 1 times [2019-09-08 12:13:38,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:38,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:39,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:39,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:13:39,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:13:39,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:13:39,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:13:39,135 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand 12 states. [2019-09-08 12:13:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:40,611 INFO L93 Difference]: Finished difference Result 900 states and 1219 transitions. [2019-09-08 12:13:40,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:13:40,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-08 12:13:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:40,615 INFO L225 Difference]: With dead ends: 900 [2019-09-08 12:13:40,615 INFO L226 Difference]: Without dead ends: 814 [2019-09-08 12:13:40,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:13:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-08 12:13:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 255. [2019-09-08 12:13:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 12:13:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2019-09-08 12:13:40,685 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 87 [2019-09-08 12:13:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:40,685 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2019-09-08 12:13:40,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:13:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2019-09-08 12:13:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:13:40,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:40,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:40,686 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1736542280, now seen corresponding path program 1 times [2019-09-08 12:13:40,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:40,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:40,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:40,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:40,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:13:40,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:13:40,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:13:40,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:13:40,814 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand 9 states. [2019-09-08 12:13:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:41,986 INFO L93 Difference]: Finished difference Result 588 states and 772 transitions. [2019-09-08 12:13:41,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:13:41,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:13:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:41,988 INFO L225 Difference]: With dead ends: 588 [2019-09-08 12:13:41,988 INFO L226 Difference]: Without dead ends: 506 [2019-09-08 12:13:41,989 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:13:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-08 12:13:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 255. [2019-09-08 12:13:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 12:13:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 305 transitions. [2019-09-08 12:13:42,042 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 305 transitions. Word has length 87 [2019-09-08 12:13:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:42,042 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 305 transitions. [2019-09-08 12:13:42,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:13:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 305 transitions. [2019-09-08 12:13:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:13:42,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:42,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:42,043 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1081579309, now seen corresponding path program 1 times [2019-09-08 12:13:42,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:42,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:42,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:42,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:42,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:42,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:42,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:13:42,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:13:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:13:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:13:42,161 INFO L87 Difference]: Start difference. First operand 255 states and 305 transitions. Second operand 9 states. [2019-09-08 12:13:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:42,883 INFO L93 Difference]: Finished difference Result 385 states and 471 transitions. [2019-09-08 12:13:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:13:42,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 12:13:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:42,884 INFO L225 Difference]: With dead ends: 385 [2019-09-08 12:13:42,885 INFO L226 Difference]: Without dead ends: 378 [2019-09-08 12:13:42,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:13:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-08 12:13:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 255. [2019-09-08 12:13:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 12:13:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2019-09-08 12:13:42,937 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 88 [2019-09-08 12:13:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:42,938 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2019-09-08 12:13:42,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:13:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2019-09-08 12:13:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:13:42,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:42,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:42,939 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1026055433, now seen corresponding path program 1 times [2019-09-08 12:13:42,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:42,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:43,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:43,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:13:43,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:13:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:13:43,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:13:43,655 INFO L87 Difference]: Start difference. First operand 255 states and 304 transitions. Second operand 14 states. [2019-09-08 12:13:44,574 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:13:44,827 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:13:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:45,630 INFO L93 Difference]: Finished difference Result 458 states and 576 transitions. [2019-09-08 12:13:45,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:13:45,630 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-09-08 12:13:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:45,631 INFO L225 Difference]: With dead ends: 458 [2019-09-08 12:13:45,631 INFO L226 Difference]: Without dead ends: 384 [2019-09-08 12:13:45,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:13:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-08 12:13:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 245. [2019-09-08 12:13:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-08 12:13:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 293 transitions. [2019-09-08 12:13:45,685 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 293 transitions. Word has length 88 [2019-09-08 12:13:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:45,685 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 293 transitions. [2019-09-08 12:13:45,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:13:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 293 transitions. [2019-09-08 12:13:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:13:45,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:45,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:45,686 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:45,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:45,686 INFO L82 PathProgramCache]: Analyzing trace with hash 309584746, now seen corresponding path program 1 times [2019-09-08 12:13:45,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:45,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:45,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:45,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:45,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:46,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:46,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:13:46,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:13:46,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:13:46,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:13:46,407 INFO L87 Difference]: Start difference. First operand 245 states and 293 transitions. Second operand 16 states. [2019-09-08 12:13:47,283 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-09-08 12:13:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:48,432 INFO L93 Difference]: Finished difference Result 824 states and 1098 transitions. [2019-09-08 12:13:48,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:13:48,433 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-08 12:13:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:48,435 INFO L225 Difference]: With dead ends: 824 [2019-09-08 12:13:48,435 INFO L226 Difference]: Without dead ends: 796 [2019-09-08 12:13:48,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:13:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-09-08 12:13:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 225. [2019-09-08 12:13:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-08 12:13:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2019-09-08 12:13:48,503 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 88 [2019-09-08 12:13:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:48,504 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2019-09-08 12:13:48,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:13:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2019-09-08 12:13:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:13:48,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:48,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:48,505 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -859860802, now seen corresponding path program 1 times [2019-09-08 12:13:48,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:48,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:48,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:48,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:48,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:13:48,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:13:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:13:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:13:48,632 INFO L87 Difference]: Start difference. First operand 225 states and 269 transitions. Second operand 9 states. [2019-09-08 12:13:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:49,381 INFO L93 Difference]: Finished difference Result 345 states and 422 transitions. [2019-09-08 12:13:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:13:49,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 12:13:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:49,383 INFO L225 Difference]: With dead ends: 345 [2019-09-08 12:13:49,383 INFO L226 Difference]: Without dead ends: 338 [2019-09-08 12:13:49,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:13:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-08 12:13:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 225. [2019-09-08 12:13:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-08 12:13:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 268 transitions. [2019-09-08 12:13:49,444 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 268 transitions. Word has length 88 [2019-09-08 12:13:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:49,444 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 268 transitions. [2019-09-08 12:13:49,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:13:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 268 transitions. [2019-09-08 12:13:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:13:49,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:49,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:49,445 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1443233902, now seen corresponding path program 1 times [2019-09-08 12:13:49,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:49,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:49,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:50,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:50,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:13:50,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:13:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:13:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:13:50,024 INFO L87 Difference]: Start difference. First operand 225 states and 268 transitions. Second operand 16 states. [2019-09-08 12:13:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:52,097 INFO L93 Difference]: Finished difference Result 648 states and 855 transitions. [2019-09-08 12:13:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:13:52,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-08 12:13:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:52,098 INFO L225 Difference]: With dead ends: 648 [2019-09-08 12:13:52,098 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 12:13:52,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:13:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 12:13:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 243. [2019-09-08 12:13:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-08 12:13:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2019-09-08 12:13:52,166 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 89 [2019-09-08 12:13:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:52,166 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2019-09-08 12:13:52,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:13:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2019-09-08 12:13:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:13:52,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:52,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:52,167 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:52,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1663669706, now seen corresponding path program 1 times [2019-09-08 12:13:52,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:52,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:52,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:52,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:53,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:13:53,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 12:13:53,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 12:13:53,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 12:13:53,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:13:53,825 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 28 states. [2019-09-08 12:13:53,996 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:13:54,883 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 12:13:55,202 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 12:13:55,496 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:13:55,860 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 12:13:56,287 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-08 12:13:56,517 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-08 12:13:56,731 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 12:13:56,949 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-08 12:13:57,275 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-08 12:13:57,472 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-08 12:13:57,679 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 12:13:57,891 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:13:58,108 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-08 12:14:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:03,679 INFO L93 Difference]: Finished difference Result 959 states and 1267 transitions. [2019-09-08 12:14:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 12:14:03,679 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2019-09-08 12:14:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:03,680 INFO L225 Difference]: With dead ends: 959 [2019-09-08 12:14:03,680 INFO L226 Difference]: Without dead ends: 951 [2019-09-08 12:14:03,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=545, Invalid=2211, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 12:14:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-08 12:14:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 253. [2019-09-08 12:14:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-08 12:14:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 301 transitions. [2019-09-08 12:14:03,749 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 301 transitions. Word has length 90 [2019-09-08 12:14:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:03,749 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 301 transitions. [2019-09-08 12:14:03,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 12:14:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 301 transitions. [2019-09-08 12:14:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:14:03,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:03,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, 1, 1] [2019-09-08 12:14:03,750 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash -868794427, now seen corresponding path program 1 times [2019-09-08 12:14:03,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:03,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:04,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:04,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:14:04,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:14:04,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:14:04,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:14:04,173 INFO L87 Difference]: Start difference. First operand 253 states and 301 transitions. Second operand 12 states. [2019-09-08 12:14:04,661 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:14:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:05,758 INFO L93 Difference]: Finished difference Result 656 states and 862 transitions. [2019-09-08 12:14:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:14:05,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-08 12:14:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:05,761 INFO L225 Difference]: With dead ends: 656 [2019-09-08 12:14:05,761 INFO L226 Difference]: Without dead ends: 650 [2019-09-08 12:14:05,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:14:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-08 12:14:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 229. [2019-09-08 12:14:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-08 12:14:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 273 transitions. [2019-09-08 12:14:05,830 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 273 transitions. Word has length 90 [2019-09-08 12:14:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:05,830 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 273 transitions. [2019-09-08 12:14:05,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:14:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2019-09-08 12:14:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:14:05,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:05,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:05,831 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1820672010, now seen corresponding path program 1 times [2019-09-08 12:14:05,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:05,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:05,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:07,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:07,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 12:14:07,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 12:14:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 12:14:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:14:07,693 INFO L87 Difference]: Start difference. First operand 229 states and 273 transitions. Second operand 28 states. [2019-09-08 12:14:07,844 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:14:08,731 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 12:14:09,083 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:14:09,359 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-08 12:14:09,703 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-08 12:14:10,154 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2019-09-08 12:14:10,368 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:14:10,575 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:14:10,760 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 12:14:11,043 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-08 12:14:11,557 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 12:14:11,761 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 12:14:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:17,500 INFO L93 Difference]: Finished difference Result 862 states and 1134 transitions. [2019-09-08 12:14:17,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:14:17,500 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2019-09-08 12:14:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:17,502 INFO L225 Difference]: With dead ends: 862 [2019-09-08 12:14:17,502 INFO L226 Difference]: Without dead ends: 854 [2019-09-08 12:14:17,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=548, Invalid=2644, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 12:14:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-09-08 12:14:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 234. [2019-09-08 12:14:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-08 12:14:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2019-09-08 12:14:17,573 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 90 [2019-09-08 12:14:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:17,574 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2019-09-08 12:14:17,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 12:14:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2019-09-08 12:14:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:14:17,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:17,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:17,575 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2135673714, now seen corresponding path program 1 times [2019-09-08 12:14:17,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:17,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:17,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:17,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:18,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:18,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:14:18,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:14:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:14:18,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:14:18,114 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand 14 states. [2019-09-08 12:14:18,808 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:14:18,934 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:14:19,190 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 12:14:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:19,866 INFO L93 Difference]: Finished difference Result 351 states and 429 transitions. [2019-09-08 12:14:19,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:14:19,866 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2019-09-08 12:14:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:19,867 INFO L225 Difference]: With dead ends: 351 [2019-09-08 12:14:19,867 INFO L226 Difference]: Without dead ends: 337 [2019-09-08 12:14:19,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:14:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-08 12:14:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 228. [2019-09-08 12:14:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-08 12:14:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2019-09-08 12:14:19,951 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 91 [2019-09-08 12:14:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:19,952 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2019-09-08 12:14:19,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:14:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2019-09-08 12:14:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:14:19,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:19,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:19,953 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash 890051108, now seen corresponding path program 1 times [2019-09-08 12:14:19,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:19,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:19,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:19,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:19,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:20,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:20,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:14:20,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:14:20,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:14:20,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:14:20,541 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand 15 states. [2019-09-08 12:14:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:21,468 INFO L93 Difference]: Finished difference Result 333 states and 412 transitions. [2019-09-08 12:14:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:14:21,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-09-08 12:14:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:21,469 INFO L225 Difference]: With dead ends: 333 [2019-09-08 12:14:21,469 INFO L226 Difference]: Without dead ends: 299 [2019-09-08 12:14:21,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:14:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-08 12:14:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 194. [2019-09-08 12:14:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-08 12:14:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 234 transitions. [2019-09-08 12:14:21,567 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 234 transitions. Word has length 91 [2019-09-08 12:14:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:21,568 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 234 transitions. [2019-09-08 12:14:21,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:14:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2019-09-08 12:14:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:14:21,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:21,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:21,569 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:21,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:21,569 INFO L82 PathProgramCache]: Analyzing trace with hash -223927789, now seen corresponding path program 1 times [2019-09-08 12:14:21,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:21,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:21,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:22,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:22,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:14:22,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:14:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:14:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:14:22,421 INFO L87 Difference]: Start difference. First operand 194 states and 234 transitions. Second operand 16 states. [2019-09-08 12:14:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:24,492 INFO L93 Difference]: Finished difference Result 513 states and 687 transitions. [2019-09-08 12:14:24,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:14:24,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-09-08 12:14:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:24,494 INFO L225 Difference]: With dead ends: 513 [2019-09-08 12:14:24,494 INFO L226 Difference]: Without dead ends: 484 [2019-09-08 12:14:24,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:14:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-08 12:14:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 159. [2019-09-08 12:14:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-08 12:14:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2019-09-08 12:14:24,589 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 91 [2019-09-08 12:14:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:24,589 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2019-09-08 12:14:24,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:14:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2019-09-08 12:14:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:14:24,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:24,590 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:24,590 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash -432709058, now seen corresponding path program 1 times [2019-09-08 12:14:24,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:24,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:24,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:24,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:24,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:24,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:24,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:24,687 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand 3 states. [2019-09-08 12:14:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:24,824 INFO L93 Difference]: Finished difference Result 283 states and 378 transitions. [2019-09-08 12:14:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:24,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 12:14:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:24,825 INFO L225 Difference]: With dead ends: 283 [2019-09-08 12:14:24,825 INFO L226 Difference]: Without dead ends: 219 [2019-09-08 12:14:24,826 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:14:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-08 12:14:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-09-08 12:14:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-08 12:14:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 281 transitions. [2019-09-08 12:14:24,919 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 281 transitions. Word has length 116 [2019-09-08 12:14:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:24,919 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 281 transitions. [2019-09-08 12:14:24,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 281 transitions. [2019-09-08 12:14:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:14:24,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:24,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:24,923 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:24,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2103932360, now seen corresponding path program 1 times [2019-09-08 12:14:24,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:24,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:24,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:24,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:24,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:25,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:25,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:14:25,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:14:25,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:14:25,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:25,012 INFO L87 Difference]: Start difference. First operand 217 states and 281 transitions. Second operand 7 states. [2019-09-08 12:14:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:25,858 INFO L93 Difference]: Finished difference Result 837 states and 1193 transitions. [2019-09-08 12:14:25,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:14:25,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:14:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:25,860 INFO L225 Difference]: With dead ends: 837 [2019-09-08 12:14:25,860 INFO L226 Difference]: Without dead ends: 715 [2019-09-08 12:14:25,861 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:14:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-09-08 12:14:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 357. [2019-09-08 12:14:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-08 12:14:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 488 transitions. [2019-09-08 12:14:26,069 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 488 transitions. Word has length 118 [2019-09-08 12:14:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:26,069 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 488 transitions. [2019-09-08 12:14:26,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:14:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 488 transitions. [2019-09-08 12:14:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:14:26,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:26,070 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:26,071 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash -792007490, now seen corresponding path program 1 times [2019-09-08 12:14:26,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:26,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:26,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:26,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:26,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:14:26,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:14:26,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:14:26,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:26,169 INFO L87 Difference]: Start difference. First operand 357 states and 488 transitions. Second operand 7 states. [2019-09-08 12:14:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:27,459 INFO L93 Difference]: Finished difference Result 1589 states and 2300 transitions. [2019-09-08 12:14:27,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:14:27,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:14:27,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:27,462 INFO L225 Difference]: With dead ends: 1589 [2019-09-08 12:14:27,463 INFO L226 Difference]: Without dead ends: 1327 [2019-09-08 12:14:27,464 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:14:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-09-08 12:14:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 657. [2019-09-08 12:14:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 12:14:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 930 transitions. [2019-09-08 12:14:27,995 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 930 transitions. Word has length 118 [2019-09-08 12:14:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:27,995 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 930 transitions. [2019-09-08 12:14:27,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:14:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 930 transitions. [2019-09-08 12:14:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:14:27,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:27,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:27,997 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1202645697, now seen corresponding path program 1 times [2019-09-08 12:14:27,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:27,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:27,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:27,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:27,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:28,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:28,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:28,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:28,066 INFO L87 Difference]: Start difference. First operand 657 states and 930 transitions. Second operand 3 states. [2019-09-08 12:14:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:28,622 INFO L93 Difference]: Finished difference Result 1509 states and 2188 transitions. [2019-09-08 12:14:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:28,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 12:14:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:28,623 INFO L225 Difference]: With dead ends: 1509 [2019-09-08 12:14:28,623 INFO L226 Difference]: Without dead ends: 947 [2019-09-08 12:14:28,624 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:14:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-09-08 12:14:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 945. [2019-09-08 12:14:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-09-08 12:14:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1350 transitions. [2019-09-08 12:14:29,153 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1350 transitions. Word has length 118 [2019-09-08 12:14:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:29,153 INFO L475 AbstractCegarLoop]: Abstraction has 945 states and 1350 transitions. [2019-09-08 12:14:29,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1350 transitions. [2019-09-08 12:14:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:14:29,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:29,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:29,155 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:29,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:29,155 INFO L82 PathProgramCache]: Analyzing trace with hash 492458048, now seen corresponding path program 1 times [2019-09-08 12:14:29,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:29,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:29,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:29,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:29,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:29,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:29,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:29,213 INFO L87 Difference]: Start difference. First operand 945 states and 1350 transitions. Second operand 3 states. [2019-09-08 12:14:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:30,056 INFO L93 Difference]: Finished difference Result 2225 states and 3218 transitions. [2019-09-08 12:14:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:30,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 12:14:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:30,058 INFO L225 Difference]: With dead ends: 2225 [2019-09-08 12:14:30,058 INFO L226 Difference]: Without dead ends: 1375 [2019-09-08 12:14:30,059 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:14:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2019-09-08 12:14:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1361. [2019-09-08 12:14:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2019-09-08 12:14:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1938 transitions. [2019-09-08 12:14:30,884 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1938 transitions. Word has length 118 [2019-09-08 12:14:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:30,885 INFO L475 AbstractCegarLoop]: Abstraction has 1361 states and 1938 transitions. [2019-09-08 12:14:30,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1938 transitions. [2019-09-08 12:14:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:14:30,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:30,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] [2019-09-08 12:14:30,886 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash -208893878, now seen corresponding path program 1 times [2019-09-08 12:14:30,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:30,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:30,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:30,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:30,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:14:30,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:14:30,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:14:30,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:30,985 INFO L87 Difference]: Start difference. First operand 1361 states and 1938 transitions. Second operand 7 states. [2019-09-08 12:14:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:34,749 INFO L93 Difference]: Finished difference Result 6533 states and 9394 transitions. [2019-09-08 12:14:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:14:34,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:14:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:34,754 INFO L225 Difference]: With dead ends: 6533 [2019-09-08 12:14:34,754 INFO L226 Difference]: Without dead ends: 5267 [2019-09-08 12:14:34,756 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:14:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2019-09-08 12:14:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 2805. [2019-09-08 12:14:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-09-08 12:14:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4026 transitions. [2019-09-08 12:14:36,457 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4026 transitions. Word has length 118 [2019-09-08 12:14:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:36,457 INFO L475 AbstractCegarLoop]: Abstraction has 2805 states and 4026 transitions. [2019-09-08 12:14:36,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:14:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4026 transitions. [2019-09-08 12:14:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:14:36,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:36,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:36,458 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash 781686468, now seen corresponding path program 1 times [2019-09-08 12:14:36,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:36,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:36,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:36,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:36,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:36,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:36,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:14:36,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:14:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:14:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:36,532 INFO L87 Difference]: Start difference. First operand 2805 states and 4026 transitions. Second operand 7 states. [2019-09-08 12:14:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:42,763 INFO L93 Difference]: Finished difference Result 11945 states and 17242 transitions. [2019-09-08 12:14:42,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:14:42,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:14:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:42,770 INFO L225 Difference]: With dead ends: 11945 [2019-09-08 12:14:42,770 INFO L226 Difference]: Without dead ends: 9235 [2019-09-08 12:14:42,776 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:14:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9235 states. [2019-09-08 12:14:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9235 to 5873. [2019-09-08 12:14:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5873 states. [2019-09-08 12:14:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5873 states to 5873 states and 8454 transitions. [2019-09-08 12:14:46,436 INFO L78 Accepts]: Start accepts. Automaton has 5873 states and 8454 transitions. Word has length 118 [2019-09-08 12:14:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:46,436 INFO L475 AbstractCegarLoop]: Abstraction has 5873 states and 8454 transitions. [2019-09-08 12:14:46,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:14:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5873 states and 8454 transitions. [2019-09-08 12:14:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:14:46,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:46,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:46,438 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1587754861, now seen corresponding path program 1 times [2019-09-08 12:14:46,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:46,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:46,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:46,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:46,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:46,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:14:46,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:14:46,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:14:46,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:14:46,479 INFO L87 Difference]: Start difference. First operand 5873 states and 8454 transitions. Second operand 3 states. [2019-09-08 12:14:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:14:50,483 INFO L93 Difference]: Finished difference Result 12245 states and 17656 transitions. [2019-09-08 12:14:50,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:14:50,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-08 12:14:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:14:50,491 INFO L225 Difference]: With dead ends: 12245 [2019-09-08 12:14:50,491 INFO L226 Difference]: Without dead ends: 6467 [2019-09-08 12:14:50,501 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:14:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6467 states. [2019-09-08 12:14:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6467 to 6417. [2019-09-08 12:14:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6417 states. [2019-09-08 12:14:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6417 states to 6417 states and 9198 transitions. [2019-09-08 12:14:54,982 INFO L78 Accepts]: Start accepts. Automaton has 6417 states and 9198 transitions. Word has length 119 [2019-09-08 12:14:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:54,983 INFO L475 AbstractCegarLoop]: Abstraction has 6417 states and 9198 transitions. [2019-09-08 12:14:54,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:14:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6417 states and 9198 transitions. [2019-09-08 12:14:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:14:54,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:54,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:14:54,984 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:54,985 INFO L82 PathProgramCache]: Analyzing trace with hash 546629509, now seen corresponding path program 1 times [2019-09-08 12:14:54,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:54,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:54,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:54,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:54,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:55,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:14:55,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:14:55,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:14:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:14:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:14:55,061 INFO L87 Difference]: Start difference. First operand 6417 states and 9198 transitions. Second operand 7 states. [2019-09-08 12:15:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:03,996 INFO L93 Difference]: Finished difference Result 19785 states and 28274 transitions. [2019-09-08 12:15:03,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:15:03,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-08 12:15:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:04,008 INFO L225 Difference]: With dead ends: 19785 [2019-09-08 12:15:04,008 INFO L226 Difference]: Without dead ends: 13463 [2019-09-08 12:15:04,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:15:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13463 states. [2019-09-08 12:15:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13463 to 7585. [2019-09-08 12:15:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7585 states. [2019-09-08 12:15:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7585 states to 7585 states and 10742 transitions. [2019-09-08 12:15:08,929 INFO L78 Accepts]: Start accepts. Automaton has 7585 states and 10742 transitions. Word has length 119 [2019-09-08 12:15:08,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:08,929 INFO L475 AbstractCegarLoop]: Abstraction has 7585 states and 10742 transitions. [2019-09-08 12:15:08,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:15:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7585 states and 10742 transitions. [2019-09-08 12:15:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:15:08,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:08,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:08,931 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:08,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1431856554, now seen corresponding path program 1 times [2019-09-08 12:15:08,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:08,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:08,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:08,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:09,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:09,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:15:09,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:15:09,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:15:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:15:09,001 INFO L87 Difference]: Start difference. First operand 7585 states and 10742 transitions. Second operand 6 states. [2019-09-08 12:15:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:17,308 INFO L93 Difference]: Finished difference Result 12089 states and 16869 transitions. [2019-09-08 12:15:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:15:17,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-08 12:15:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:17,320 INFO L225 Difference]: With dead ends: 12089 [2019-09-08 12:15:17,320 INFO L226 Difference]: Without dead ends: 12087 [2019-09-08 12:15:17,323 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:15:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12087 states. [2019-09-08 12:15:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12087 to 7681. [2019-09-08 12:15:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7681 states. [2019-09-08 12:15:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7681 states to 7681 states and 10806 transitions. [2019-09-08 12:15:22,270 INFO L78 Accepts]: Start accepts. Automaton has 7681 states and 10806 transitions. Word has length 119 [2019-09-08 12:15:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:22,271 INFO L475 AbstractCegarLoop]: Abstraction has 7681 states and 10806 transitions. [2019-09-08 12:15:22,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:15:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 7681 states and 10806 transitions. [2019-09-08 12:15:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:15:22,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:22,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:22,273 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1588867289, now seen corresponding path program 1 times [2019-09-08 12:15:22,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:22,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:22,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:22,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:22,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:22,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:22,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:22,344 INFO L87 Difference]: Start difference. First operand 7681 states and 10806 transitions. Second operand 3 states. [2019-09-08 12:15:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:30,168 INFO L93 Difference]: Finished difference Result 19861 states and 28088 transitions. [2019-09-08 12:15:30,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:30,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:15:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:30,179 INFO L225 Difference]: With dead ends: 19861 [2019-09-08 12:15:30,179 INFO L226 Difference]: Without dead ends: 12275 [2019-09-08 12:15:30,187 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:15:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12275 states. [2019-09-08 12:15:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12275 to 8929. [2019-09-08 12:15:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8929 states. [2019-09-08 12:15:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8929 states to 8929 states and 12586 transitions. [2019-09-08 12:15:35,943 INFO L78 Accepts]: Start accepts. Automaton has 8929 states and 12586 transitions. Word has length 120 [2019-09-08 12:15:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:35,944 INFO L475 AbstractCegarLoop]: Abstraction has 8929 states and 12586 transitions. [2019-09-08 12:15:35,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8929 states and 12586 transitions. [2019-09-08 12:15:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:15:35,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:35,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:35,945 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:35,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:35,945 INFO L82 PathProgramCache]: Analyzing trace with hash 852693951, now seen corresponding path program 1 times [2019-09-08 12:15:35,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:35,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:35,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:15:35,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:35,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:35,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:35,989 INFO L87 Difference]: Start difference. First operand 8929 states and 12586 transitions. Second operand 3 states. [2019-09-08 12:15:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:41,574 INFO L93 Difference]: Finished difference Result 17345 states and 24460 transitions. [2019-09-08 12:15:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:41,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:15:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:41,582 INFO L225 Difference]: With dead ends: 17345 [2019-09-08 12:15:41,582 INFO L226 Difference]: Without dead ends: 8511 [2019-09-08 12:15:41,591 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:15:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8511 states. [2019-09-08 12:15:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8511 to 8509. [2019-09-08 12:15:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2019-09-08 12:15:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 11914 transitions. [2019-09-08 12:15:47,554 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 11914 transitions. Word has length 121 [2019-09-08 12:15:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:15:47,555 INFO L475 AbstractCegarLoop]: Abstraction has 8509 states and 11914 transitions. [2019-09-08 12:15:47,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:15:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 11914 transitions. [2019-09-08 12:15:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 12:15:47,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:15:47,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:15:47,558 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:15:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:15:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1840940587, now seen corresponding path program 1 times [2019-09-08 12:15:47,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:15:47,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:15:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:47,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:15:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:15:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:15:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:15:47,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:15:47,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:15:47,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:15:47,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:15:47,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:15:47,628 INFO L87 Difference]: Start difference. First operand 8509 states and 11914 transitions. Second operand 3 states. [2019-09-08 12:15:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:15:54,662 INFO L93 Difference]: Finished difference Result 18889 states and 26436 transitions. [2019-09-08 12:15:54,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:15:54,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 12:15:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:15:54,675 INFO L225 Difference]: With dead ends: 18889 [2019-09-08 12:15:54,676 INFO L226 Difference]: Without dead ends: 10475 [2019-09-08 12:15:54,688 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:15:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10475 states. [2019-09-08 12:16:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10475 to 7789. [2019-09-08 12:16:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7789 states. [2019-09-08 12:16:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7789 states to 7789 states and 10762 transitions. [2019-09-08 12:16:00,024 INFO L78 Accepts]: Start accepts. Automaton has 7789 states and 10762 transitions. Word has length 149 [2019-09-08 12:16:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:00,024 INFO L475 AbstractCegarLoop]: Abstraction has 7789 states and 10762 transitions. [2019-09-08 12:16:00,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 7789 states and 10762 transitions. [2019-09-08 12:16:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:16:00,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:00,027 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:00,027 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash -179680522, now seen corresponding path program 1 times [2019-09-08 12:16:00,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:00,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:00,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:00,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:00,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:00,094 INFO L87 Difference]: Start difference. First operand 7789 states and 10762 transitions. Second operand 3 states. [2019-09-08 12:16:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:05,261 INFO L93 Difference]: Finished difference Result 14855 states and 20464 transitions. [2019-09-08 12:16:05,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:05,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 12:16:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:05,267 INFO L225 Difference]: With dead ends: 14855 [2019-09-08 12:16:05,267 INFO L226 Difference]: Without dead ends: 7161 [2019-09-08 12:16:05,274 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:16:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2019-09-08 12:16:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 6979. [2019-09-08 12:16:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6979 states. [2019-09-08 12:16:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6979 states to 6979 states and 9502 transitions. [2019-09-08 12:16:10,271 INFO L78 Accepts]: Start accepts. Automaton has 6979 states and 9502 transitions. Word has length 150 [2019-09-08 12:16:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:10,271 INFO L475 AbstractCegarLoop]: Abstraction has 6979 states and 9502 transitions. [2019-09-08 12:16:10,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:16:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6979 states and 9502 transitions. [2019-09-08 12:16:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:16:10,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:10,273 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:16:10,273 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:10,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1022567355, now seen corresponding path program 1 times [2019-09-08 12:16:10,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:10,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:10,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:10,448 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:16:10,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:10,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:16:10,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:16:10,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:16:10,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:16:10,450 INFO L87 Difference]: Start difference. First operand 6979 states and 9502 transitions. Second operand 5 states. [2019-09-08 12:16:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:24,212 INFO L93 Difference]: Finished difference Result 25683 states and 34993 transitions. [2019-09-08 12:16:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:16:24,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-08 12:16:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:24,229 INFO L225 Difference]: With dead ends: 25683 [2019-09-08 12:16:24,229 INFO L226 Difference]: Without dead ends: 18799 [2019-09-08 12:16:24,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:16:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18799 states. [2019-09-08 12:16:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18799 to 18217. [2019-09-08 12:16:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18217 states. [2019-09-08 12:16:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18217 states to 18217 states and 24782 transitions. [2019-09-08 12:16:38,251 INFO L78 Accepts]: Start accepts. Automaton has 18217 states and 24782 transitions. Word has length 151 [2019-09-08 12:16:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:38,251 INFO L475 AbstractCegarLoop]: Abstraction has 18217 states and 24782 transitions. [2019-09-08 12:16:38,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:16:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 18217 states and 24782 transitions. [2019-09-08 12:16:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:16:38,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:38,254 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] [2019-09-08 12:16:38,254 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1960475071, now seen corresponding path program 1 times [2019-09-08 12:16:38,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:38,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:38,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:16:38,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:16:38,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:16:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:16:38,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:16:38,314 INFO L87 Difference]: Start difference. First operand 18217 states and 24782 transitions. Second operand 3 states. [2019-09-08 12:16:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:54,842 INFO L93 Difference]: Finished difference Result 40197 states and 54536 transitions. [2019-09-08 12:16:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:16:54,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 12:16:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:54,861 INFO L225 Difference]: With dead ends: 40197 [2019-09-08 12:16:54,861 INFO L226 Difference]: Without dead ends: 22075 [2019-09-08 12:16:54,874 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:16:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22075 states. [2019-09-08 12:17:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22075 to 21033. [2019-09-08 12:17:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21033 states. [2019-09-08 12:17:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21033 states to 21033 states and 28294 transitions. [2019-09-08 12:17:10,480 INFO L78 Accepts]: Start accepts. Automaton has 21033 states and 28294 transitions. Word has length 151 [2019-09-08 12:17:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:10,481 INFO L475 AbstractCegarLoop]: Abstraction has 21033 states and 28294 transitions. [2019-09-08 12:17:10,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:17:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21033 states and 28294 transitions. [2019-09-08 12:17:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:17:10,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:10,483 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:17:10,484 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:10,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:10,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1790644147, now seen corresponding path program 1 times [2019-09-08 12:17:10,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:10,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:10,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:10,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:10,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:17:10,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:10,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:17:10,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:17:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:17:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:17:10,538 INFO L87 Difference]: Start difference. First operand 21033 states and 28294 transitions. Second operand 3 states. [2019-09-08 12:17:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:17:24,666 INFO L93 Difference]: Finished difference Result 39281 states and 52588 transitions. [2019-09-08 12:17:24,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:17:24,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 12:17:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:17:24,683 INFO L225 Difference]: With dead ends: 39281 [2019-09-08 12:17:24,683 INFO L226 Difference]: Without dead ends: 18343 [2019-09-08 12:17:24,697 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:17:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18343 states. [2019-09-08 12:17:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18343 to 18201. [2019-09-08 12:17:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18201 states. [2019-09-08 12:17:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18201 states to 18201 states and 23946 transitions. [2019-09-08 12:17:38,395 INFO L78 Accepts]: Start accepts. Automaton has 18201 states and 23946 transitions. Word has length 152 [2019-09-08 12:17:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:17:38,395 INFO L475 AbstractCegarLoop]: Abstraction has 18201 states and 23946 transitions. [2019-09-08 12:17:38,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:17:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 18201 states and 23946 transitions. [2019-09-08 12:17:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:17:38,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:17:38,398 INFO L399 BasicCegarLoop]: trace histogram [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:17:38,398 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:17:38,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:17:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash -119430980, now seen corresponding path program 1 times [2019-09-08 12:17:38,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:17:38,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:17:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:38,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:17:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:17:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:17:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:17:38,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:17:38,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:17:38,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:17:38,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:17:38,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:17:38,487 INFO L87 Difference]: Start difference. First operand 18201 states and 23946 transitions. Second operand 5 states. [2019-09-08 12:18:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:00,999 INFO L93 Difference]: Finished difference Result 46739 states and 61473 transitions. [2019-09-08 12:18:01,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:01,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-08 12:18:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:01,027 INFO L225 Difference]: With dead ends: 46739 [2019-09-08 12:18:01,028 INFO L226 Difference]: Without dead ends: 28633 [2019-09-08 12:18:01,045 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:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28633 states. [2019-09-08 12:18:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28633 to 23041. [2019-09-08 12:18:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23041 states. [2019-09-08 12:18:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23041 states to 23041 states and 30346 transitions. [2019-09-08 12:18:18,632 INFO L78 Accepts]: Start accepts. Automaton has 23041 states and 30346 transitions. Word has length 153 [2019-09-08 12:18:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:18,633 INFO L475 AbstractCegarLoop]: Abstraction has 23041 states and 30346 transitions. [2019-09-08 12:18:18,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 23041 states and 30346 transitions. [2019-09-08 12:18:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:18:18,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:18,635 INFO L399 BasicCegarLoop]: trace histogram [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:18:18,635 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 463682632, now seen corresponding path program 1 times [2019-09-08 12:18:18,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:18,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:18,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:18,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:18,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:18,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:18:18,911 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:18:18,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:19,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:18:19,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:18:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:18:19,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:18:19,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2019-09-08 12:18:19,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:18:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:18:19,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:18:19,375 INFO L87 Difference]: Start difference. First operand 23041 states and 30346 transitions. Second operand 17 states. [2019-09-08 12:18:20,381 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:18:21,864 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:18:22,656 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:18:26,033 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 12:18:28,026 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:18:28,835 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:18:50,813 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-08 12:22:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:15,241 INFO L93 Difference]: Finished difference Result 284266 states and 371596 transitions. [2019-09-08 12:22:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-08 12:22:15,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 153 [2019-09-08 12:22:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:15,923 INFO L225 Difference]: With dead ends: 284266 [2019-09-08 12:22:15,923 INFO L226 Difference]: Without dead ends: 261320 [2019-09-08 12:22:16,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8281 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=3929, Invalid=17241, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 12:22:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261320 states. [2019-09-08 12:23:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261320 to 65300. [2019-09-08 12:23:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65300 states. [2019-09-08 12:23:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65300 states to 65300 states and 85765 transitions. [2019-09-08 12:23:12,286 INFO L78 Accepts]: Start accepts. Automaton has 65300 states and 85765 transitions. Word has length 153 [2019-09-08 12:23:12,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:12,286 INFO L475 AbstractCegarLoop]: Abstraction has 65300 states and 85765 transitions. [2019-09-08 12:23:12,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:23:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 65300 states and 85765 transitions. [2019-09-08 12:23:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:23:12,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:12,297 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:23:12,297 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1698634191, now seen corresponding path program 1 times [2019-09-08 12:23:12,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:12,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:12,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:23:12,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:12,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:12,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:12,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:12,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:12,545 INFO L87 Difference]: Start difference. First operand 65300 states and 85765 transitions. Second operand 5 states. [2019-09-08 12:24:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:26,481 INFO L93 Difference]: Finished difference Result 142822 states and 187548 transitions. [2019-09-08 12:24:26,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:26,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-09-08 12:24:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:26,638 INFO L225 Difference]: With dead ends: 142822 [2019-09-08 12:24:26,639 INFO L226 Difference]: Without dead ends: 88900 [2019-09-08 12:24:26,695 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:24:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88900 states. [2019-09-08 12:25:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88900 to 76702. [2019-09-08 12:25:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76702 states. [2019-09-08 12:25:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76702 states to 76702 states and 100813 transitions. [2019-09-08 12:25:32,170 INFO L78 Accepts]: Start accepts. Automaton has 76702 states and 100813 transitions. Word has length 154 [2019-09-08 12:25:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:32,170 INFO L475 AbstractCegarLoop]: Abstraction has 76702 states and 100813 transitions. [2019-09-08 12:25:32,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:25:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 76702 states and 100813 transitions. [2019-09-08 12:25:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:25:32,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:32,175 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:25:32,175 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash 146521759, now seen corresponding path program 1 times [2019-09-08 12:25:32,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:32,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:32,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:25:32,471 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:25:32,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:32,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:25:32,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:25:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:25:33,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:25:33,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-09-08 12:25:33,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:25:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:25:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:25:33,128 INFO L87 Difference]: Start difference. First operand 76702 states and 100813 transitions. Second operand 15 states.