java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:04:12,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:04:12,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:04:12,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:04:12,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:04:12,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:04:12,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:04:12,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:04:12,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:04:12,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:04:12,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:04:12,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:04:12,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:04:12,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:04:12,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:04:12,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:04:12,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:04:12,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:04:12,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:04:12,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:04:12,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:04:12,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:04:12,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:04:12,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:04:12,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:04:12,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:04:12,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:04:12,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:04:12,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:04:12,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:04:12,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:04:12,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:04:12,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:04:12,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:04:12,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:04:12,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:04:12,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:04:12,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:04:12,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:04:12,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:04:12,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:04:12,491 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 11:04:12,505 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:04:12,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:04:12,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:04:12,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:04:12,507 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:04:12,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:04:12,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:04:12,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:04:12,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:04:12,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:04:12,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:04:12,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:04:12,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:04:12,508 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:04:12,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:04:12,509 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:04:12,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:04:12,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:04:12,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:04:12,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:04:12,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:04:12,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:04:12,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:04:12,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:04:12,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:04:12,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:04:12,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:04:12,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:04:12,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:04:12,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:04:12,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:04:12,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:04:12,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:04:12,558 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:04:12,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:04:12,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8eab4b3/fbdb50cfcd67450f9b2e4dd0ad4e9276/FLAG47bb84e50 [2019-09-08 11:04:13,200 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:04:13,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:04:13,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8eab4b3/fbdb50cfcd67450f9b2e4dd0ad4e9276/FLAG47bb84e50 [2019-09-08 11:04:13,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8eab4b3/fbdb50cfcd67450f9b2e4dd0ad4e9276 [2019-09-08 11:04:13,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:04:13,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:04:13,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:04:13,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:04:13,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:04:13,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:04:13" (1/1) ... [2019-09-08 11:04:13,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5735c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:13, skipping insertion in model container [2019-09-08 11:04:13,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:04:13" (1/1) ... [2019-09-08 11:04:13,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:04:13,554 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:04:14,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:04:14,108 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:04:14,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:04:14,288 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:04:14,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14 WrapperNode [2019-09-08 11:04:14,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:04:14,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:04:14,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:04:14,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:04:14,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (1/1) ... [2019-09-08 11:04:14,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (1/1) ... [2019-09-08 11:04:14,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (1/1) ... [2019-09-08 11:04:14,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (1/1) ... [2019-09-08 11:04:14,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (1/1) ... [2019-09-08 11:04:14,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (1/1) ... [2019-09-08 11:04:14,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (1/1) ... [2019-09-08 11:04:14,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:04:14,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:04:14,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:04:14,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:04:14,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (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 11:04:14,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:04:14,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:04:14,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:04:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:04:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:04:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:04:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:04:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:04:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:04:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:04:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:04:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:04:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:04:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:04:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:04:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:04:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:04:14,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:04:14,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:04:14,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:04:16,102 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:04:16,103 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:04:16,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:04:16 BoogieIcfgContainer [2019-09-08 11:04:16,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:04:16,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:04:16,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:04:16,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:04:16,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:04:13" (1/3) ... [2019-09-08 11:04:16,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae425f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:04:16, skipping insertion in model container [2019-09-08 11:04:16,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:04:14" (2/3) ... [2019-09-08 11:04:16,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae425f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:04:16, skipping insertion in model container [2019-09-08 11:04:16,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:04:16" (3/3) ... [2019-09-08 11:04:16,112 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:04:16,122 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:04:16,130 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:04:16,152 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:04:16,210 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:04:16,211 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:04:16,211 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:04:16,211 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:04:16,212 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:04:16,212 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:04:16,212 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:04:16,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:04:16,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:04:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states. [2019-09-08 11:04:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 11:04:16,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:16,302 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:16,305 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash -986324288, now seen corresponding path program 1 times [2019-09-08 11:04:16,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:16,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:16,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:16,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:16,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:16,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:04:16,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:04:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:04:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:04:16,803 INFO L87 Difference]: Start difference. First operand 411 states. Second operand 4 states. [2019-09-08 11:04:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:17,051 INFO L93 Difference]: Finished difference Result 788 states and 1276 transitions. [2019-09-08 11:04:17,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:04:17,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-08 11:04:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:17,072 INFO L225 Difference]: With dead ends: 788 [2019-09-08 11:04:17,072 INFO L226 Difference]: Without dead ends: 407 [2019-09-08 11:04:17,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:04:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-08 11:04:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-09-08 11:04:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-08 11:04:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 627 transitions. [2019-09-08 11:04:17,156 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 627 transitions. Word has length 107 [2019-09-08 11:04:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:17,157 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 627 transitions. [2019-09-08 11:04:17,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:04:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 627 transitions. [2019-09-08 11:04:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 11:04:17,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:17,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:17,161 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash -267942580, now seen corresponding path program 1 times [2019-09-08 11:04:17,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:17,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:17,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:17,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:17,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:17,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:17,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:17,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:17,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:17,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:17,453 INFO L87 Difference]: Start difference. First operand 407 states and 627 transitions. Second operand 3 states. [2019-09-08 11:04:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:17,555 INFO L93 Difference]: Finished difference Result 1002 states and 1577 transitions. [2019-09-08 11:04:17,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:17,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 11:04:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:17,562 INFO L225 Difference]: With dead ends: 1002 [2019-09-08 11:04:17,562 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 11:04:17,567 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 11:04:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 11:04:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2019-09-08 11:04:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 11:04:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 998 transitions. [2019-09-08 11:04:17,629 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 998 transitions. Word has length 138 [2019-09-08 11:04:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:17,631 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 998 transitions. [2019-09-08 11:04:17,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 998 transitions. [2019-09-08 11:04:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 11:04:17,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:17,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:17,636 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:17,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:17,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1029982986, now seen corresponding path program 1 times [2019-09-08 11:04:17,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:17,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:17,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:17,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:17,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:17,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:17,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:17,777 INFO L87 Difference]: Start difference. First operand 641 states and 998 transitions. Second operand 3 states. [2019-09-08 11:04:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:17,857 INFO L93 Difference]: Finished difference Result 1618 states and 2555 transitions. [2019-09-08 11:04:17,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:17,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 11:04:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:17,864 INFO L225 Difference]: With dead ends: 1618 [2019-09-08 11:04:17,865 INFO L226 Difference]: Without dead ends: 1038 [2019-09-08 11:04:17,867 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 11:04:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2019-09-08 11:04:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1036. [2019-09-08 11:04:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-08 11:04:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1622 transitions. [2019-09-08 11:04:17,907 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1622 transitions. Word has length 138 [2019-09-08 11:04:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:17,908 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1622 transitions. [2019-09-08 11:04:17,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1622 transitions. [2019-09-08 11:04:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 11:04:17,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:17,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:17,913 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash 52580276, now seen corresponding path program 1 times [2019-09-08 11:04:17,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:17,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:17,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:17,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:17,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:18,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:18,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:18,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:18,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:18,042 INFO L87 Difference]: Start difference. First operand 1036 states and 1622 transitions. Second operand 3 states. [2019-09-08 11:04:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:18,144 INFO L93 Difference]: Finished difference Result 2659 states and 4198 transitions. [2019-09-08 11:04:18,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:18,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-08 11:04:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:18,157 INFO L225 Difference]: With dead ends: 2659 [2019-09-08 11:04:18,157 INFO L226 Difference]: Without dead ends: 1697 [2019-09-08 11:04:18,161 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 11:04:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-09-08 11:04:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1695. [2019-09-08 11:04:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-09-08 11:04:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2656 transitions. [2019-09-08 11:04:18,235 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2656 transitions. Word has length 140 [2019-09-08 11:04:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:18,235 INFO L475 AbstractCegarLoop]: Abstraction has 1695 states and 2656 transitions. [2019-09-08 11:04:18,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2656 transitions. [2019-09-08 11:04:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 11:04:18,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:18,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:18,242 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:18,243 INFO L82 PathProgramCache]: Analyzing trace with hash 749398092, now seen corresponding path program 1 times [2019-09-08 11:04:18,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:18,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:18,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:18,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:18,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:18,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:18,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:18,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:18,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:18,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:18,346 INFO L87 Difference]: Start difference. First operand 1695 states and 2656 transitions. Second operand 3 states. [2019-09-08 11:04:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:18,491 INFO L93 Difference]: Finished difference Result 4356 states and 6851 transitions. [2019-09-08 11:04:18,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:18,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 11:04:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:18,507 INFO L225 Difference]: With dead ends: 4356 [2019-09-08 11:04:18,507 INFO L226 Difference]: Without dead ends: 2748 [2019-09-08 11:04:18,511 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 11:04:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2019-09-08 11:04:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2746. [2019-09-08 11:04:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2746 states. [2019-09-08 11:04:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 4286 transitions. [2019-09-08 11:04:18,716 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 4286 transitions. Word has length 142 [2019-09-08 11:04:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:18,716 INFO L475 AbstractCegarLoop]: Abstraction has 2746 states and 4286 transitions. [2019-09-08 11:04:18,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 4286 transitions. [2019-09-08 11:04:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 11:04:18,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:18,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:18,726 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash 215854232, now seen corresponding path program 1 times [2019-09-08 11:04:18,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:18,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:18,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:18,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:18,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:18,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:18,845 INFO L87 Difference]: Start difference. First operand 2746 states and 4286 transitions. Second operand 3 states. [2019-09-08 11:04:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:19,068 INFO L93 Difference]: Finished difference Result 6957 states and 10852 transitions. [2019-09-08 11:04:19,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:19,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 11:04:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:19,092 INFO L225 Difference]: With dead ends: 6957 [2019-09-08 11:04:19,092 INFO L226 Difference]: Without dead ends: 4311 [2019-09-08 11:04:19,098 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 11:04:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2019-09-08 11:04:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 4309. [2019-09-08 11:04:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4309 states. [2019-09-08 11:04:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 4309 states and 6660 transitions. [2019-09-08 11:04:19,350 INFO L78 Accepts]: Start accepts. Automaton has 4309 states and 6660 transitions. Word has length 144 [2019-09-08 11:04:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:19,351 INFO L475 AbstractCegarLoop]: Abstraction has 4309 states and 6660 transitions. [2019-09-08 11:04:19,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4309 states and 6660 transitions. [2019-09-08 11:04:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 11:04:19,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:19,366 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:19,366 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash 317610490, now seen corresponding path program 1 times [2019-09-08 11:04:19,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:19,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:19,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:19,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:19,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:04:19,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:04:19,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:04:19,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:04:19,758 INFO L87 Difference]: Start difference. First operand 4309 states and 6660 transitions. Second operand 7 states. [2019-09-08 11:04:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:21,081 INFO L93 Difference]: Finished difference Result 22255 states and 34188 transitions. [2019-09-08 11:04:21,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:04:21,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 11:04:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:21,165 INFO L225 Difference]: With dead ends: 22255 [2019-09-08 11:04:21,166 INFO L226 Difference]: Without dead ends: 18040 [2019-09-08 11:04:21,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:04:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18040 states. [2019-09-08 11:04:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18040 to 18032. [2019-09-08 11:04:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18032 states. [2019-09-08 11:04:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18032 states to 18032 states and 27401 transitions. [2019-09-08 11:04:22,266 INFO L78 Accepts]: Start accepts. Automaton has 18032 states and 27401 transitions. Word has length 146 [2019-09-08 11:04:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:22,266 INFO L475 AbstractCegarLoop]: Abstraction has 18032 states and 27401 transitions. [2019-09-08 11:04:22,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:04:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18032 states and 27401 transitions. [2019-09-08 11:04:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 11:04:22,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:22,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:22,315 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1963375210, now seen corresponding path program 1 times [2019-09-08 11:04:22,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:22,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:22,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:22,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:22,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:22,416 INFO L87 Difference]: Start difference. First operand 18032 states and 27401 transitions. Second operand 3 states. [2019-09-08 11:04:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:23,552 INFO L93 Difference]: Finished difference Result 40828 states and 61896 transitions. [2019-09-08 11:04:23,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:23,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 11:04:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:23,623 INFO L225 Difference]: With dead ends: 40828 [2019-09-08 11:04:23,623 INFO L226 Difference]: Without dead ends: 29852 [2019-09-08 11:04:23,652 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 11:04:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29852 states. [2019-09-08 11:04:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29852 to 29850. [2019-09-08 11:04:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29850 states. [2019-09-08 11:04:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29850 states to 29850 states and 44958 transitions. [2019-09-08 11:04:25,578 INFO L78 Accepts]: Start accepts. Automaton has 29850 states and 44958 transitions. Word has length 149 [2019-09-08 11:04:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:25,579 INFO L475 AbstractCegarLoop]: Abstraction has 29850 states and 44958 transitions. [2019-09-08 11:04:25,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29850 states and 44958 transitions. [2019-09-08 11:04:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 11:04:25,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:25,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:25,671 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash 745206864, now seen corresponding path program 1 times [2019-09-08 11:04:25,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:25,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:25,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:25,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:25,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:25,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:25,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:25,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:25,914 INFO L87 Difference]: Start difference. First operand 29850 states and 44958 transitions. Second operand 3 states. [2019-09-08 11:04:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:27,060 INFO L93 Difference]: Finished difference Result 49874 states and 74996 transitions. [2019-09-08 11:04:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:27,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 11:04:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:27,144 INFO L225 Difference]: With dead ends: 49874 [2019-09-08 11:04:27,144 INFO L226 Difference]: Without dead ends: 36600 [2019-09-08 11:04:27,176 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 11:04:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36600 states. [2019-09-08 11:04:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36600 to 36598. [2019-09-08 11:04:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36598 states. [2019-09-08 11:04:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36598 states to 36598 states and 55138 transitions. [2019-09-08 11:04:29,218 INFO L78 Accepts]: Start accepts. Automaton has 36598 states and 55138 transitions. Word has length 149 [2019-09-08 11:04:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:29,219 INFO L475 AbstractCegarLoop]: Abstraction has 36598 states and 55138 transitions. [2019-09-08 11:04:29,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 36598 states and 55138 transitions. [2019-09-08 11:04:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 11:04:29,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:29,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:29,259 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2085871384, now seen corresponding path program 1 times [2019-09-08 11:04:29,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:29,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:29,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:29,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:29,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:29,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:29,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:04:29,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:04:29,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:04:29,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:04:29,355 INFO L87 Difference]: Start difference. First operand 36598 states and 55138 transitions. Second operand 3 states. [2019-09-08 11:04:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:30,895 INFO L93 Difference]: Finished difference Result 93472 states and 140366 transitions. [2019-09-08 11:04:30,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:04:30,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 11:04:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:31,036 INFO L225 Difference]: With dead ends: 93472 [2019-09-08 11:04:31,037 INFO L226 Difference]: Without dead ends: 61480 [2019-09-08 11:04:31,098 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 11:04:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61480 states. [2019-09-08 11:04:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61480 to 61478. [2019-09-08 11:04:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61478 states. [2019-09-08 11:04:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61478 states to 61478 states and 91592 transitions. [2019-09-08 11:04:34,335 INFO L78 Accepts]: Start accepts. Automaton has 61478 states and 91592 transitions. Word has length 150 [2019-09-08 11:04:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:34,335 INFO L475 AbstractCegarLoop]: Abstraction has 61478 states and 91592 transitions. [2019-09-08 11:04:34,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 61478 states and 91592 transitions. [2019-09-08 11:04:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 11:04:34,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:34,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:34,410 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 54971742, now seen corresponding path program 1 times [2019-09-08 11:04:34,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:34,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:34,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:34,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:34,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:04:34,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:04:34,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:04:34,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:04:34,625 INFO L87 Difference]: Start difference. First operand 61478 states and 91592 transitions. Second operand 7 states. [2019-09-08 11:04:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:42,541 INFO L93 Difference]: Finished difference Result 260821 states and 386562 transitions. [2019-09-08 11:04:42,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:04:42,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-09-08 11:04:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:42,816 INFO L225 Difference]: With dead ends: 260821 [2019-09-08 11:04:42,816 INFO L226 Difference]: Without dead ends: 199767 [2019-09-08 11:04:42,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:04:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199767 states. [2019-09-08 11:04:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199767 to 117773. [2019-09-08 11:04:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117773 states. [2019-09-08 11:04:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117773 states to 117773 states and 171651 transitions. [2019-09-08 11:04:48,240 INFO L78 Accepts]: Start accepts. Automaton has 117773 states and 171651 transitions. Word has length 150 [2019-09-08 11:04:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:48,241 INFO L475 AbstractCegarLoop]: Abstraction has 117773 states and 171651 transitions. [2019-09-08 11:04:48,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:04:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 117773 states and 171651 transitions. [2019-09-08 11:04:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:04:48,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:48,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:48,358 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash 231406676, now seen corresponding path program 1 times [2019-09-08 11:04:48,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:48,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:48,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:48,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:48,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:04:48,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:04:48,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:04:48,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:04:48,478 INFO L87 Difference]: Start difference. First operand 117773 states and 171651 transitions. Second operand 6 states. [2019-09-08 11:04:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:55,845 INFO L93 Difference]: Finished difference Result 170511 states and 247636 transitions. [2019-09-08 11:04:55,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:04:55,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-09-08 11:04:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:56,053 INFO L225 Difference]: With dead ends: 170511 [2019-09-08 11:04:56,054 INFO L226 Difference]: Without dead ends: 170509 [2019-09-08 11:04:56,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:04:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170509 states. [2019-09-08 11:05:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170509 to 120077. [2019-09-08 11:05:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120077 states. [2019-09-08 11:05:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120077 states to 120077 states and 173955 transitions. [2019-09-08 11:05:01,917 INFO L78 Accepts]: Start accepts. Automaton has 120077 states and 173955 transitions. Word has length 154 [2019-09-08 11:05:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:01,918 INFO L475 AbstractCegarLoop]: Abstraction has 120077 states and 173955 transitions. [2019-09-08 11:05:01,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:05:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 120077 states and 173955 transitions. [2019-09-08 11:05:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:05:02,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:02,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:02,052 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:02,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2041688229, now seen corresponding path program 1 times [2019-09-08 11:05:02,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:02,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:02,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:02,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:02,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:05:02,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:02,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:05:02,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:05:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:05:02,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:05:02,179 INFO L87 Difference]: Start difference. First operand 120077 states and 173955 transitions. Second operand 7 states. [2019-09-08 11:05:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:14,561 INFO L93 Difference]: Finished difference Result 255913 states and 369029 transitions. [2019-09-08 11:05:14,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:05:14,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 154 [2019-09-08 11:05:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:14,875 INFO L225 Difference]: With dead ends: 255913 [2019-09-08 11:05:14,876 INFO L226 Difference]: Without dead ends: 207015 [2019-09-08 11:05:14,979 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 11:05:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207015 states. [2019-09-08 11:05:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207015 to 118183. [2019-09-08 11:05:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118183 states. [2019-09-08 11:05:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118183 states to 118183 states and 171077 transitions. [2019-09-08 11:05:22,808 INFO L78 Accepts]: Start accepts. Automaton has 118183 states and 171077 transitions. Word has length 154 [2019-09-08 11:05:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:22,808 INFO L475 AbstractCegarLoop]: Abstraction has 118183 states and 171077 transitions. [2019-09-08 11:05:22,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:05:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 118183 states and 171077 transitions. [2019-09-08 11:05:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:05:22,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:22,924 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1863138123, now seen corresponding path program 1 times [2019-09-08 11:05:22,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:22,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:22,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:22,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:22,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:23,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 11:05:23,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:23,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:23,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:23,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:23,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:23,007 INFO L87 Difference]: Start difference. First operand 118183 states and 171077 transitions. Second operand 3 states. [2019-09-08 11:05:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:33,432 INFO L93 Difference]: Finished difference Result 267960 states and 385699 transitions. [2019-09-08 11:05:33,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:05:33,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-08 11:05:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:33,625 INFO L225 Difference]: With dead ends: 267960 [2019-09-08 11:05:33,625 INFO L226 Difference]: Without dead ends: 176202 [2019-09-08 11:05:33,714 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 11:05:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176202 states. [2019-09-08 11:05:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176202 to 169602. [2019-09-08 11:05:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169602 states. [2019-09-08 11:05:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169602 states to 169602 states and 242171 transitions. [2019-09-08 11:05:45,866 INFO L78 Accepts]: Start accepts. Automaton has 169602 states and 242171 transitions. Word has length 154 [2019-09-08 11:05:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:45,867 INFO L475 AbstractCegarLoop]: Abstraction has 169602 states and 242171 transitions. [2019-09-08 11:05:45,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:05:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 169602 states and 242171 transitions. [2019-09-08 11:05:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:05:46,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:46,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:46,032 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:46,032 INFO L82 PathProgramCache]: Analyzing trace with hash 385954444, now seen corresponding path program 1 times [2019-09-08 11:05:46,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:46,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:46,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:46,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:05:46,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:46,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:46,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:46,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:46,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:46,110 INFO L87 Difference]: Start difference. First operand 169602 states and 242171 transitions. Second operand 3 states. [2019-09-08 11:06:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:02,405 INFO L93 Difference]: Finished difference Result 357985 states and 508275 transitions. [2019-09-08 11:06:02,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:02,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-09-08 11:06:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:02,678 INFO L225 Difference]: With dead ends: 357985 [2019-09-08 11:06:02,678 INFO L226 Difference]: Without dead ends: 217611 [2019-09-08 11:06:02,776 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 11:06:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217611 states. [2019-09-08 11:06:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217611 to 213566. [2019-09-08 11:06:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213566 states. [2019-09-08 11:06:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213566 states to 213566 states and 300808 transitions. [2019-09-08 11:06:18,877 INFO L78 Accepts]: Start accepts. Automaton has 213566 states and 300808 transitions. Word has length 154 [2019-09-08 11:06:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:18,877 INFO L475 AbstractCegarLoop]: Abstraction has 213566 states and 300808 transitions. [2019-09-08 11:06:18,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 213566 states and 300808 transitions. [2019-09-08 11:06:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:06:19,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:19,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:19,075 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:19,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1676859252, now seen corresponding path program 1 times [2019-09-08 11:06:19,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:19,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:19,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:19,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:19,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:19,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:19,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:19,180 INFO L87 Difference]: Start difference. First operand 213566 states and 300808 transitions. Second operand 5 states. [2019-09-08 11:06:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:40,803 INFO L93 Difference]: Finished difference Result 516512 states and 725560 transitions. [2019-09-08 11:06:40,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:40,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-09-08 11:06:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:41,197 INFO L225 Difference]: With dead ends: 516512 [2019-09-08 11:06:41,197 INFO L226 Difference]: Without dead ends: 303055 [2019-09-08 11:06:41,336 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 11:06:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303055 states. [2019-09-08 11:07:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303055 to 302631. [2019-09-08 11:07:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302631 states. [2019-09-08 11:07:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302631 states to 302631 states and 422124 transitions. [2019-09-08 11:07:06,257 INFO L78 Accepts]: Start accepts. Automaton has 302631 states and 422124 transitions. Word has length 154 [2019-09-08 11:07:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:06,257 INFO L475 AbstractCegarLoop]: Abstraction has 302631 states and 422124 transitions. [2019-09-08 11:07:06,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:07:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 302631 states and 422124 transitions. [2019-09-08 11:07:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:07:06,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:06,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:07:06,573 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1589890942, now seen corresponding path program 1 times [2019-09-08 11:07:06,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:06,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:06,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:06,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:06,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:07:07,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:07,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:07:07,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:07:07,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:07:07,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:07:07,280 INFO L87 Difference]: Start difference. First operand 302631 states and 422124 transitions. Second operand 7 states. [2019-09-08 11:08:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:13,985 INFO L93 Difference]: Finished difference Result 937420 states and 1301485 transitions. [2019-09-08 11:08:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:08:13,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 154 [2019-09-08 11:08:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:15,255 INFO L225 Difference]: With dead ends: 937420 [2019-09-08 11:08:15,256 INFO L226 Difference]: Without dead ends: 862730 [2019-09-08 11:08:15,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:08:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862730 states. [2019-09-08 11:08:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862730 to 304461. [2019-09-08 11:08:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304461 states. [2019-09-08 11:08:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304461 states to 304461 states and 424802 transitions. [2019-09-08 11:08:54,301 INFO L78 Accepts]: Start accepts. Automaton has 304461 states and 424802 transitions. Word has length 154 [2019-09-08 11:08:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:54,301 INFO L475 AbstractCegarLoop]: Abstraction has 304461 states and 424802 transitions. [2019-09-08 11:08:54,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:08:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 304461 states and 424802 transitions. [2019-09-08 11:08:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:08:54,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:54,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:54,624 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1301996817, now seen corresponding path program 1 times [2019-09-08 11:08:54,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:54,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:54,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:54,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:54,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:54,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:54,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:08:54,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:08:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:08:54,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:08:54,729 INFO L87 Difference]: Start difference. First operand 304461 states and 424802 transitions. Second operand 5 states. [2019-09-08 11:09:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:33,111 INFO L93 Difference]: Finished difference Result 723539 states and 1007258 transitions. [2019-09-08 11:09:33,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:09:33,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-09-08 11:09:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:33,691 INFO L225 Difference]: With dead ends: 723539 [2019-09-08 11:09:33,691 INFO L226 Difference]: Without dead ends: 419323 [2019-09-08 11:09:33,899 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 11:09:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419323 states. [2019-09-08 11:10:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419323 to 418505. [2019-09-08 11:10:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418505 states. [2019-09-08 11:10:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418505 states to 418505 states and 578153 transitions. [2019-09-08 11:10:15,994 INFO L78 Accepts]: Start accepts. Automaton has 418505 states and 578153 transitions. Word has length 154 [2019-09-08 11:10:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:15,994 INFO L475 AbstractCegarLoop]: Abstraction has 418505 states and 578153 transitions. [2019-09-08 11:10:15,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:10:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 418505 states and 578153 transitions. [2019-09-08 11:10:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:10:16,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:16,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:16,485 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1650618681, now seen corresponding path program 1 times [2019-09-08 11:10:16,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:16,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:16,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:16,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:10:16,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:10:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:10:16,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:10:16,634 INFO L87 Difference]: Start difference. First operand 418505 states and 578153 transitions. Second operand 7 states. [2019-09-08 11:12:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:00,327 INFO L93 Difference]: Finished difference Result 1232176 states and 1686265 transitions. [2019-09-08 11:12:00,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:12:00,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 154 [2019-09-08 11:12:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:01,776 INFO L225 Difference]: With dead ends: 1232176 [2019-09-08 11:12:01,776 INFO L226 Difference]: Without dead ends: 1040100 [2019-09-08 11:12:02,052 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 11:12:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040100 states. [2019-09-08 11:12:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040100 to 422314. [2019-09-08 11:12:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422314 states. [2019-09-08 11:12:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422314 states to 422314 states and 583608 transitions. [2019-09-08 11:12:58,965 INFO L78 Accepts]: Start accepts. Automaton has 422314 states and 583608 transitions. Word has length 154 [2019-09-08 11:12:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:58,966 INFO L475 AbstractCegarLoop]: Abstraction has 422314 states and 583608 transitions. [2019-09-08 11:12:58,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:12:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 422314 states and 583608 transitions. [2019-09-08 11:12:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 11:12:59,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:59,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:12:59,437 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash -981943530, now seen corresponding path program 1 times [2019-09-08 11:12:59,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:59,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:59,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:12:59,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:59,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:12:59,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:12:59,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:12:59,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:12:59,566 INFO L87 Difference]: Start difference. First operand 422314 states and 583608 transitions. Second operand 7 states. [2019-09-08 11:14:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:53,432 INFO L93 Difference]: Finished difference Result 1122355 states and 1534980 transitions. [2019-09-08 11:14:53,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:14:53,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 154 [2019-09-08 11:14:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:54,869 INFO L225 Difference]: With dead ends: 1122355 [2019-09-08 11:14:54,870 INFO L226 Difference]: Without dead ends: 998769 [2019-09-08 11:14:55,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:14:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998769 states.