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/product-lines/elevator_spec3_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:34:48,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:34:48,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:34:48,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:34:48,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:34:48,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:34:48,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:34:48,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:34:48,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:34:48,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:34:48,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:34:48,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:34:48,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:34:48,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:34:48,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:34:48,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:34:48,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:34:48,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:34:48,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:34:48,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:34:48,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:34:48,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:34:48,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:34:48,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:34:48,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:34:48,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:34:48,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:34:48,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:34:48,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:34:48,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:34:48,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:34:48,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:34:48,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:34:48,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:34:48,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:34:48,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:34:48,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:34:48,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:34:48,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:34:48,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:34:48,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:34:48,490 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-10-02 12:34:48,505 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:34:48,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:34:48,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:34:48,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:34:48,507 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:34:48,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:34:48,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:34:48,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:34:48,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:34:48,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:34:48,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:34:48,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:34:48,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:34:48,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:34:48,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:34:48,509 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:34:48,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:34:48,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:34:48,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:34:48,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:34:48,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:34:48,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:34:48,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:34:48,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:34:48,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:34:48,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:34:48,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:34:48,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:34:48,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:34:48,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:34:48,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:34:48,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:34:48,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:34:48,558 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:34:48,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_productSimulator.cil.c [2019-10-02 12:34:48,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0254adf47/b36b6b298f124726a7faa40d8f1fe85b/FLAGd23fb6e79 [2019-10-02 12:34:49,330 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:34:49,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_productSimulator.cil.c [2019-10-02 12:34:49,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0254adf47/b36b6b298f124726a7faa40d8f1fe85b/FLAGd23fb6e79 [2019-10-02 12:34:49,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0254adf47/b36b6b298f124726a7faa40d8f1fe85b [2019-10-02 12:34:49,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:34:49,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:34:49,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:34:49,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:34:49,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:34:49,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:34:49" (1/1) ... [2019-10-02 12:34:49,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7d2efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:49, skipping insertion in model container [2019-10-02 12:34:49,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:34:49" (1/1) ... [2019-10-02 12:34:49,472 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:34:49,563 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:34:50,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:34:50,421 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:34:50,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:34:50,771 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:34:50,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50 WrapperNode [2019-10-02 12:34:50,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:34:50,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:34:50,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:34:50,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:34:50,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (1/1) ... [2019-10-02 12:34:50,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (1/1) ... [2019-10-02 12:34:50,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (1/1) ... [2019-10-02 12:34:50,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (1/1) ... [2019-10-02 12:34:50,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (1/1) ... [2019-10-02 12:34:50,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (1/1) ... [2019-10-02 12:34:50,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (1/1) ... [2019-10-02 12:34:50,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:34:50,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:34:50,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:34:50,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:34:50,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (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-10-02 12:34:51,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:34:51,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:34:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:34:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:34:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:34:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:34:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:34:51,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:34:51,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:34:51,062 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:34:51,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:34:51,062 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:34:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:34:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:34:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:34:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:34:51,064 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:34:51,064 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:34:51,064 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:34:51,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:34:51,064 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:34:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:34:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-02 12:34:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-02 12:34:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:34:51,066 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-02 12:34:51,066 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-02 12:34:51,066 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:34:51,066 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-02 12:34:51,066 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-02 12:34:51,066 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-02 12:34:51,066 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-02 12:34:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:34:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:34:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:34:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:34:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:34:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:34:51,067 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:34:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:34:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:34:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:34:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-02 12:34:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-02 12:34:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-02 12:34:51,069 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-02 12:34:51,069 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:34:51,069 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:34:51,069 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:34:51,069 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-02 12:34:51,069 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-02 12:34:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-02 12:34:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-02 12:34:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:34:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:34:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:34:51,070 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-02 12:34:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-02 12:34:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:34:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-02 12:34:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-02 12:34:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:34:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:34:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:34:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:34:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:34:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:34:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:34:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:34:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:34:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:34:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:34:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:34:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:34:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:34:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:34:51,074 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:34:51,074 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:34:51,074 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:34:51,074 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:34:51,074 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:34:51,074 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:34:51,074 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:34:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:34:51,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:34:51,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:34:51,076 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:34:51,077 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:34:51,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:34:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:34:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:34:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:34:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-02 12:34:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-02 12:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-02 12:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-02 12:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-02 12:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-02 12:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-02 12:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-02 12:34:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:34:51,085 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:34:51,085 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:34:51,085 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:34:51,085 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:34:51,085 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-02 12:34:51,085 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-02 12:34:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-02 12:34:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-02 12:34:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:34:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:34:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-02 12:34:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-02 12:34:51,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-02 12:34:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-02 12:34:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:34:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:34:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:34:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-02 12:34:51,087 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-02 12:34:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:34:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:34:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-02 12:34:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-02 12:34:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:34:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:34:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:34:51,090 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:34:51,090 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:34:51,090 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:34:51,090 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:34:51,090 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:34:51,091 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:34:51,091 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:34:51,091 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:34:51,091 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:34:51,091 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:34:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:34:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:34:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:34:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:34:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:34:51,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:34:51,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:34:51,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:34:51,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:34:53,683 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:34:53,683 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:34:53,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:34:53 BoogieIcfgContainer [2019-10-02 12:34:53,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:34:53,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:34:53,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:34:53,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:34:53,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:34:49" (1/3) ... [2019-10-02 12:34:53,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c10ccbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:34:53, skipping insertion in model container [2019-10-02 12:34:53,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:50" (2/3) ... [2019-10-02 12:34:53,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c10ccbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:34:53, skipping insertion in model container [2019-10-02 12:34:53,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:34:53" (3/3) ... [2019-10-02 12:34:53,694 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_productSimulator.cil.c [2019-10-02 12:34:53,704 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:34:53,714 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:34:53,734 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:34:53,787 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:34:53,788 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:34:53,788 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:34:53,788 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:34:53,789 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:34:53,789 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:34:53,789 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:34:53,789 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:34:53,789 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:34:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states. [2019-10-02 12:34:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 12:34:53,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:53,883 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:53,887 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash -895643454, now seen corresponding path program 1 times [2019-10-02 12:34:53,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:53,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:53,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:53,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:54,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:54,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:34:54,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:34:54,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:34:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:54,712 INFO L87 Difference]: Start difference. First operand 949 states. Second operand 6 states. [2019-10-02 12:34:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:54,941 INFO L93 Difference]: Finished difference Result 1545 states and 2408 transitions. [2019-10-02 12:34:54,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:34:54,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-10-02 12:34:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:54,991 INFO L225 Difference]: With dead ends: 1545 [2019-10-02 12:34:54,991 INFO L226 Difference]: Without dead ends: 776 [2019-10-02 12:34:55,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-10-02 12:34:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2019-10-02 12:34:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-02 12:34:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1196 transitions. [2019-10-02 12:34:55,181 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1196 transitions. Word has length 127 [2019-10-02 12:34:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:55,190 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1196 transitions. [2019-10-02 12:34:55,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:34:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1196 transitions. [2019-10-02 12:34:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:34:55,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:55,198 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:55,198 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:55,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:55,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1694033836, now seen corresponding path program 1 times [2019-10-02 12:34:55,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:55,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:55,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:55,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:55,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:55,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:55,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:55,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:55,579 INFO L87 Difference]: Start difference. First operand 776 states and 1196 transitions. Second operand 7 states. [2019-10-02 12:34:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:55,817 INFO L93 Difference]: Finished difference Result 1508 states and 2347 transitions. [2019-10-02 12:34:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:55,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-02 12:34:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:55,833 INFO L225 Difference]: With dead ends: 1508 [2019-10-02 12:34:55,834 INFO L226 Difference]: Without dead ends: 785 [2019-10-02 12:34:55,839 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-10-02 12:34:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783. [2019-10-02 12:34:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-10-02 12:34:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1205 transitions. [2019-10-02 12:34:55,894 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1205 transitions. Word has length 128 [2019-10-02 12:34:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:55,895 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1205 transitions. [2019-10-02 12:34:55,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1205 transitions. [2019-10-02 12:34:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 12:34:55,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:55,900 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:55,900 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash 54665970, now seen corresponding path program 1 times [2019-10-02 12:34:55,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:55,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:55,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:56,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:56,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:34:56,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:34:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:34:56,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:34:56,100 INFO L87 Difference]: Start difference. First operand 783 states and 1205 transitions. Second operand 4 states. [2019-10-02 12:34:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:56,166 INFO L93 Difference]: Finished difference Result 1511 states and 2348 transitions. [2019-10-02 12:34:56,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:34:56,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-02 12:34:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:56,173 INFO L225 Difference]: With dead ends: 1511 [2019-10-02 12:34:56,173 INFO L226 Difference]: Without dead ends: 765 [2019-10-02 12:34:56,177 INFO L640 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-10-02 12:34:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-10-02 12:34:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-10-02 12:34:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-10-02 12:34:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1172 transitions. [2019-10-02 12:34:56,205 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1172 transitions. Word has length 129 [2019-10-02 12:34:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:56,205 INFO L475 AbstractCegarLoop]: Abstraction has 765 states and 1172 transitions. [2019-10-02 12:34:56,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:34:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1172 transitions. [2019-10-02 12:34:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 12:34:56,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:56,208 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:56,208 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:56,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1943043330, now seen corresponding path program 1 times [2019-10-02 12:34:56,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:56,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:56,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:56,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:56,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:56,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:56,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:56,385 INFO L87 Difference]: Start difference. First operand 765 states and 1172 transitions. Second operand 7 states. [2019-10-02 12:34:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:56,513 INFO L93 Difference]: Finished difference Result 1480 states and 2290 transitions. [2019-10-02 12:34:56,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:56,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-02 12:34:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:56,540 INFO L225 Difference]: With dead ends: 1480 [2019-10-02 12:34:56,541 INFO L226 Difference]: Without dead ends: 759 [2019-10-02 12:34:56,552 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-10-02 12:34:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-10-02 12:34:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-02 12:34:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1159 transitions. [2019-10-02 12:34:56,591 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1159 transitions. Word has length 129 [2019-10-02 12:34:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:56,593 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1159 transitions. [2019-10-02 12:34:56,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1159 transitions. [2019-10-02 12:34:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:34:56,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:56,599 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:56,600 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash 264736656, now seen corresponding path program 1 times [2019-10-02 12:34:56,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:56,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:56,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:56,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:56,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:56,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:56,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:56,870 INFO L87 Difference]: Start difference. First operand 759 states and 1159 transitions. Second operand 7 states. [2019-10-02 12:34:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:56,985 INFO L93 Difference]: Finished difference Result 1468 states and 2264 transitions. [2019-10-02 12:34:56,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:56,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-02 12:34:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:56,993 INFO L225 Difference]: With dead ends: 1468 [2019-10-02 12:34:56,994 INFO L226 Difference]: Without dead ends: 753 [2019-10-02 12:34:56,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-10-02 12:34:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2019-10-02 12:34:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-10-02 12:34:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1146 transitions. [2019-10-02 12:34:57,032 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1146 transitions. Word has length 130 [2019-10-02 12:34:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:57,033 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1146 transitions. [2019-10-02 12:34:57,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1146 transitions. [2019-10-02 12:34:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 12:34:57,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:57,036 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:57,037 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1030829082, now seen corresponding path program 1 times [2019-10-02 12:34:57,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:57,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:57,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:57,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:57,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:57,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:57,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:57,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:57,255 INFO L87 Difference]: Start difference. First operand 753 states and 1146 transitions. Second operand 7 states. [2019-10-02 12:34:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:57,372 INFO L93 Difference]: Finished difference Result 1456 states and 2238 transitions. [2019-10-02 12:34:57,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:57,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-10-02 12:34:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:57,381 INFO L225 Difference]: With dead ends: 1456 [2019-10-02 12:34:57,381 INFO L226 Difference]: Without dead ends: 747 [2019-10-02 12:34:57,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-10-02 12:34:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-10-02 12:34:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-10-02 12:34:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1133 transitions. [2019-10-02 12:34:57,421 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1133 transitions. Word has length 131 [2019-10-02 12:34:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:57,422 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1133 transitions. [2019-10-02 12:34:57,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1133 transitions. [2019-10-02 12:34:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 12:34:57,425 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:57,425 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:57,426 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1840417433, now seen corresponding path program 1 times [2019-10-02 12:34:57,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:57,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:57,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:57,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:57,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:57,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:57,697 INFO L87 Difference]: Start difference. First operand 747 states and 1133 transitions. Second operand 7 states. [2019-10-02 12:34:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:57,808 INFO L93 Difference]: Finished difference Result 1444 states and 2212 transitions. [2019-10-02 12:34:57,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:57,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-10-02 12:34:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:57,817 INFO L225 Difference]: With dead ends: 1444 [2019-10-02 12:34:57,817 INFO L226 Difference]: Without dead ends: 747 [2019-10-02 12:34:57,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-10-02 12:34:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-10-02 12:34:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-10-02 12:34:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1132 transitions. [2019-10-02 12:34:57,853 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1132 transitions. Word has length 131 [2019-10-02 12:34:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:57,855 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1132 transitions. [2019-10-02 12:34:57,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1132 transitions. [2019-10-02 12:34:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 12:34:57,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:57,857 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:57,858 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 948639604, now seen corresponding path program 1 times [2019-10-02 12:34:57,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:57,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:57,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:58,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:58,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:34:58,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:34:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:34:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:58,017 INFO L87 Difference]: Start difference. First operand 747 states and 1132 transitions. Second operand 5 states. [2019-10-02 12:34:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:58,103 INFO L93 Difference]: Finished difference Result 1443 states and 2209 transitions. [2019-10-02 12:34:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:58,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-02 12:34:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:58,110 INFO L225 Difference]: With dead ends: 1443 [2019-10-02 12:34:58,110 INFO L226 Difference]: Without dead ends: 747 [2019-10-02 12:34:58,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-10-02 12:34:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-10-02 12:34:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-10-02 12:34:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1131 transitions. [2019-10-02 12:34:58,164 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1131 transitions. Word has length 132 [2019-10-02 12:34:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:58,165 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1131 transitions. [2019-10-02 12:34:58,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:34:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1131 transitions. [2019-10-02 12:34:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:34:58,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:58,167 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:58,167 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1456106658, now seen corresponding path program 1 times [2019-10-02 12:34:58,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:58,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:58,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:58,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:34:58,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:34:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:34:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:58,335 INFO L87 Difference]: Start difference. First operand 747 states and 1131 transitions. Second operand 5 states. [2019-10-02 12:34:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:58,441 INFO L93 Difference]: Finished difference Result 1443 states and 2207 transitions. [2019-10-02 12:34:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:58,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-02 12:34:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:58,452 INFO L225 Difference]: With dead ends: 1443 [2019-10-02 12:34:58,453 INFO L226 Difference]: Without dead ends: 747 [2019-10-02 12:34:58,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-10-02 12:34:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-10-02 12:34:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-10-02 12:34:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1130 transitions. [2019-10-02 12:34:58,493 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1130 transitions. Word has length 133 [2019-10-02 12:34:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:58,493 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1130 transitions. [2019-10-02 12:34:58,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:34:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1130 transitions. [2019-10-02 12:34:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:34:58,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:58,497 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:58,497 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash 857053327, now seen corresponding path program 1 times [2019-10-02 12:34:58,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:58,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:58,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:58,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:58,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:58,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:58,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:34:58,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:34:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:34:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:58,653 INFO L87 Difference]: Start difference. First operand 747 states and 1130 transitions. Second operand 5 states. [2019-10-02 12:34:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:58,778 INFO L93 Difference]: Finished difference Result 1443 states and 2205 transitions. [2019-10-02 12:34:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:58,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-10-02 12:34:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:58,785 INFO L225 Difference]: With dead ends: 1443 [2019-10-02 12:34:58,785 INFO L226 Difference]: Without dead ends: 747 [2019-10-02 12:34:58,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-10-02 12:34:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-10-02 12:34:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-10-02 12:34:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1129 transitions. [2019-10-02 12:34:58,821 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1129 transitions. Word has length 134 [2019-10-02 12:34:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:58,821 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1129 transitions. [2019-10-02 12:34:58,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:34:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1129 transitions. [2019-10-02 12:34:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:34:58,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:58,824 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:58,824 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash -898548391, now seen corresponding path program 1 times [2019-10-02 12:34:58,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:58,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:58,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:58,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:58,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:34:58,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:58,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:34:58,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:34:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:34:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:58,974 INFO L87 Difference]: Start difference. First operand 747 states and 1129 transitions. Second operand 5 states. [2019-10-02 12:34:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:59,052 INFO L93 Difference]: Finished difference Result 1443 states and 2203 transitions. [2019-10-02 12:34:59,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:59,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-02 12:34:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:59,059 INFO L225 Difference]: With dead ends: 1443 [2019-10-02 12:34:59,059 INFO L226 Difference]: Without dead ends: 747 [2019-10-02 12:34:59,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-10-02 12:34:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-10-02 12:34:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-10-02 12:34:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1128 transitions. [2019-10-02 12:34:59,094 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1128 transitions. Word has length 135 [2019-10-02 12:34:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:59,094 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1128 transitions. [2019-10-02 12:34:59,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:34:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1128 transitions. [2019-10-02 12:34:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:34:59,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:59,097 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:59,097 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash 63255978, now seen corresponding path program 1 times [2019-10-02 12:34:59,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:59,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:59,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:59,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:59,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:34:59,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:34:59,376 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:34:59,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:00,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 3361 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:35:00,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:35:00,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:00,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-10-02 12:35:00,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:35:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:35:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:35:00,206 INFO L87 Difference]: Start difference. First operand 747 states and 1128 transitions. Second operand 11 states. [2019-10-02 12:35:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:10,714 INFO L93 Difference]: Finished difference Result 4705 states and 7423 transitions. [2019-10-02 12:35:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 12:35:10,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2019-10-02 12:35:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:10,752 INFO L225 Difference]: With dead ends: 4705 [2019-10-02 12:35:10,752 INFO L226 Difference]: Without dead ends: 4013 [2019-10-02 12:35:10,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 12:35:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2019-10-02 12:35:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3973. [2019-10-02 12:35:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2019-10-02 12:35:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6203 transitions. [2019-10-02 12:35:11,002 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6203 transitions. Word has length 136 [2019-10-02 12:35:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:11,002 INFO L475 AbstractCegarLoop]: Abstraction has 3973 states and 6203 transitions. [2019-10-02 12:35:11,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:35:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6203 transitions. [2019-10-02 12:35:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:35:11,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:11,005 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:11,006 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash -727992524, now seen corresponding path program 1 times [2019-10-02 12:35:11,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:11,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:11,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:11,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:11,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:35:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:11,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:35:11,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:35:11,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:35:11,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:35:11,244 INFO L87 Difference]: Start difference. First operand 3973 states and 6203 transitions. Second operand 8 states. [2019-10-02 12:35:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:15,504 INFO L93 Difference]: Finished difference Result 12739 states and 20093 transitions. [2019-10-02 12:35:15,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:35:15,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2019-10-02 12:35:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:15,600 INFO L225 Difference]: With dead ends: 12739 [2019-10-02 12:35:15,600 INFO L226 Difference]: Without dead ends: 8845 [2019-10-02 12:35:15,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:35:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8845 states. [2019-10-02 12:35:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8845 to 6325. [2019-10-02 12:35:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6325 states. [2019-10-02 12:35:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6325 states to 6325 states and 9799 transitions. [2019-10-02 12:35:16,039 INFO L78 Accepts]: Start accepts. Automaton has 6325 states and 9799 transitions. Word has length 137 [2019-10-02 12:35:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:16,039 INFO L475 AbstractCegarLoop]: Abstraction has 6325 states and 9799 transitions. [2019-10-02 12:35:16,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:35:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 6325 states and 9799 transitions. [2019-10-02 12:35:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:35:16,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:16,042 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:16,042 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash -369524467, now seen corresponding path program 1 times [2019-10-02 12:35:16,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:16,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:16,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:16,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:16,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:35:16,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:16,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:35:16,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:16,215 INFO L87 Difference]: Start difference. First operand 6325 states and 9799 transitions. Second operand 7 states. [2019-10-02 12:35:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:20,049 INFO L93 Difference]: Finished difference Result 18729 states and 30062 transitions. [2019-10-02 12:35:20,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:20,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-02 12:35:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:20,166 INFO L225 Difference]: With dead ends: 18729 [2019-10-02 12:35:20,166 INFO L226 Difference]: Without dead ends: 12483 [2019-10-02 12:35:20,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:35:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12483 states. [2019-10-02 12:35:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12483 to 12411. [2019-10-02 12:35:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12411 states. [2019-10-02 12:35:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12411 states to 12411 states and 19461 transitions. [2019-10-02 12:35:21,655 INFO L78 Accepts]: Start accepts. Automaton has 12411 states and 19461 transitions. Word has length 140 [2019-10-02 12:35:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:21,656 INFO L475 AbstractCegarLoop]: Abstraction has 12411 states and 19461 transitions. [2019-10-02 12:35:21,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 12411 states and 19461 transitions. [2019-10-02 12:35:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:35:21,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:21,659 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:21,660 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1904993576, now seen corresponding path program 1 times [2019-10-02 12:35:21,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:21,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:35:21,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:21,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:21,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:21,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:21,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:21,835 INFO L87 Difference]: Start difference. First operand 12411 states and 19461 transitions. Second operand 4 states. [2019-10-02 12:35:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:22,346 INFO L93 Difference]: Finished difference Result 24719 states and 39249 transitions. [2019-10-02 12:35:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:35:22,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-02 12:35:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:22,436 INFO L225 Difference]: With dead ends: 24719 [2019-10-02 12:35:22,436 INFO L226 Difference]: Without dead ends: 12387 [2019-10-02 12:35:22,484 INFO L640 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-10-02 12:35:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2019-10-02 12:35:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 12367. [2019-10-02 12:35:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12367 states. [2019-10-02 12:35:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12367 states to 12367 states and 19325 transitions. [2019-10-02 12:35:23,058 INFO L78 Accepts]: Start accepts. Automaton has 12367 states and 19325 transitions. Word has length 141 [2019-10-02 12:35:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:23,058 INFO L475 AbstractCegarLoop]: Abstraction has 12367 states and 19325 transitions. [2019-10-02 12:35:23,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 12367 states and 19325 transitions. [2019-10-02 12:35:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:35:23,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:23,062 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:23,062 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1033568062, now seen corresponding path program 1 times [2019-10-02 12:35:23,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:23,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:23,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:23,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:23,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:35:23,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:23,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:35:23,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:23,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:23,233 INFO L87 Difference]: Start difference. First operand 12367 states and 19325 transitions. Second operand 7 states. [2019-10-02 12:35:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:27,249 INFO L93 Difference]: Finished difference Result 36977 states and 60080 transitions. [2019-10-02 12:35:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:27,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-10-02 12:35:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:27,397 INFO L225 Difference]: With dead ends: 36977 [2019-10-02 12:35:27,397 INFO L226 Difference]: Without dead ends: 24689 [2019-10-02 12:35:27,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:35:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-10-02 12:35:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 24557. [2019-10-02 12:35:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24557 states. [2019-10-02 12:35:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24557 states to 24557 states and 39129 transitions. [2019-10-02 12:35:28,621 INFO L78 Accepts]: Start accepts. Automaton has 24557 states and 39129 transitions. Word has length 149 [2019-10-02 12:35:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:28,622 INFO L475 AbstractCegarLoop]: Abstraction has 24557 states and 39129 transitions. [2019-10-02 12:35:28,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24557 states and 39129 transitions. [2019-10-02 12:35:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:35:28,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:28,626 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:28,626 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:28,627 INFO L82 PathProgramCache]: Analyzing trace with hash 649688267, now seen corresponding path program 1 times [2019-10-02 12:35:28,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:28,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:28,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:28,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:28,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:35:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:28,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:28,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:28,790 INFO L87 Difference]: Start difference. First operand 24557 states and 39129 transitions. Second operand 4 states. [2019-10-02 12:35:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:29,738 INFO L93 Difference]: Finished difference Result 49167 states and 79433 transitions. [2019-10-02 12:35:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:35:29,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-02 12:35:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:29,928 INFO L225 Difference]: With dead ends: 49167 [2019-10-02 12:35:29,928 INFO L226 Difference]: Without dead ends: 24677 [2019-10-02 12:35:30,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-02 12:35:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24677 states. [2019-10-02 12:35:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24677 to 24629. [2019-10-02 12:35:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24629 states. [2019-10-02 12:35:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24629 states to 24629 states and 39135 transitions. [2019-10-02 12:35:32,363 INFO L78 Accepts]: Start accepts. Automaton has 24629 states and 39135 transitions. Word has length 150 [2019-10-02 12:35:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:32,364 INFO L475 AbstractCegarLoop]: Abstraction has 24629 states and 39135 transitions. [2019-10-02 12:35:32,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 24629 states and 39135 transitions. [2019-10-02 12:35:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:35:32,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:32,366 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:32,367 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1479401462, now seen corresponding path program 1 times [2019-10-02 12:35:32,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:32,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:32,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:32,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:35:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:32,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:35:32,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:32,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:32,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:32,525 INFO L87 Difference]: Start difference. First operand 24629 states and 39135 transitions. Second operand 7 states. [2019-10-02 12:35:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:36,598 INFO L93 Difference]: Finished difference Result 73941 states and 123322 transitions. [2019-10-02 12:35:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:36,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-10-02 12:35:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:36,931 INFO L225 Difference]: With dead ends: 73941 [2019-10-02 12:35:36,932 INFO L226 Difference]: Without dead ends: 49391 [2019-10-02 12:35:37,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:35:37,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49391 states. [2019-10-02 12:35:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49391 to 49163. [2019-10-02 12:35:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49163 states. [2019-10-02 12:35:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49163 states to 49163 states and 80807 transitions. [2019-10-02 12:35:39,112 INFO L78 Accepts]: Start accepts. Automaton has 49163 states and 80807 transitions. Word has length 159 [2019-10-02 12:35:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:39,113 INFO L475 AbstractCegarLoop]: Abstraction has 49163 states and 80807 transitions. [2019-10-02 12:35:39,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49163 states and 80807 transitions. [2019-10-02 12:35:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:35:39,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:39,115 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:39,116 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1863931707, now seen corresponding path program 1 times [2019-10-02 12:35:39,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:39,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:39,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:39,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:39,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:35:39,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:39,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:39,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:39,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:39,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:39,257 INFO L87 Difference]: Start difference. First operand 49163 states and 80807 transitions. Second operand 4 states. [2019-10-02 12:35:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:42,155 INFO L93 Difference]: Finished difference Result 98523 states and 164943 transitions. [2019-10-02 12:35:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:35:42,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-02 12:35:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:42,459 INFO L225 Difference]: With dead ends: 98523 [2019-10-02 12:35:42,459 INFO L226 Difference]: Without dead ends: 49423 [2019-10-02 12:35:42,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-02 12:35:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49423 states. [2019-10-02 12:35:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49423 to 49319. [2019-10-02 12:35:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49319 states. [2019-10-02 12:35:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49319 states to 49319 states and 80911 transitions. [2019-10-02 12:35:44,794 INFO L78 Accepts]: Start accepts. Automaton has 49319 states and 80911 transitions. Word has length 160 [2019-10-02 12:35:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:44,795 INFO L475 AbstractCegarLoop]: Abstraction has 49319 states and 80911 transitions. [2019-10-02 12:35:44,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 49319 states and 80911 transitions. [2019-10-02 12:35:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:35:44,797 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:44,797 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:44,798 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash -945589083, now seen corresponding path program 1 times [2019-10-02 12:35:44,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:44,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:44,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 12:35:44,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:44,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:35:44,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:44,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:44,934 INFO L87 Difference]: Start difference. First operand 49319 states and 80911 transitions. Second operand 7 states. [2019-10-02 12:35:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:51,822 INFO L93 Difference]: Finished difference Result 148285 states and 260428 transitions. [2019-10-02 12:35:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:51,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-02 12:35:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:52,291 INFO L225 Difference]: With dead ends: 148285 [2019-10-02 12:35:52,292 INFO L226 Difference]: Without dead ends: 99045 [2019-10-02 12:35:52,474 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:35:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99045 states. [2019-10-02 12:35:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99045 to 98657. [2019-10-02 12:35:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98657 states. [2019-10-02 12:35:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98657 states to 98657 states and 171989 transitions. [2019-10-02 12:35:59,720 INFO L78 Accepts]: Start accepts. Automaton has 98657 states and 171989 transitions. Word has length 170 [2019-10-02 12:35:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:59,720 INFO L475 AbstractCegarLoop]: Abstraction has 98657 states and 171989 transitions. [2019-10-02 12:35:59,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 98657 states and 171989 transitions. [2019-10-02 12:35:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:35:59,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:59,723 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:59,723 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1188889176, now seen corresponding path program 1 times [2019-10-02 12:35:59,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:59,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:59,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:35:59,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:59,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:35:59,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:35:59,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:35:59,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:35:59,891 INFO L87 Difference]: Start difference. First operand 98657 states and 171989 transitions. Second operand 3 states. [2019-10-02 12:36:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:08,590 INFO L93 Difference]: Finished difference Result 260527 states and 499310 transitions. [2019-10-02 12:36:08,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:36:08,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 12:36:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:09,608 INFO L225 Difference]: With dead ends: 260527 [2019-10-02 12:36:09,608 INFO L226 Difference]: Without dead ends: 161917 [2019-10-02 12:36:10,067 INFO L640 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-10-02 12:36:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161917 states. [2019-10-02 12:36:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161917 to 154125. [2019-10-02 12:36:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154125 states. [2019-10-02 12:36:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154125 states to 154125 states and 270393 transitions. [2019-10-02 12:36:22,286 INFO L78 Accepts]: Start accepts. Automaton has 154125 states and 270393 transitions. Word has length 171 [2019-10-02 12:36:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:22,286 INFO L475 AbstractCegarLoop]: Abstraction has 154125 states and 270393 transitions. [2019-10-02 12:36:22,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:36:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 154125 states and 270393 transitions. [2019-10-02 12:36:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:36:22,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:22,289 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:22,290 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:22,290 INFO L82 PathProgramCache]: Analyzing trace with hash -912544072, now seen corresponding path program 1 times [2019-10-02 12:36:22,290 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:22,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:22,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:22,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:36:22,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:22,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:36:22,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:36:22,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:36:22,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:36:22,413 INFO L87 Difference]: Start difference. First operand 154125 states and 270393 transitions. Second operand 4 states. [2019-10-02 12:36:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:33,163 INFO L93 Difference]: Finished difference Result 306739 states and 556857 transitions. [2019-10-02 12:36:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:36:33,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-10-02 12:36:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:34,089 INFO L225 Difference]: With dead ends: 306739 [2019-10-02 12:36:34,089 INFO L226 Difference]: Without dead ends: 152657 [2019-10-02 12:36:34,783 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-02 12:36:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152657 states. [2019-10-02 12:36:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152657 to 152305. [2019-10-02 12:36:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152305 states. [2019-10-02 12:36:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152305 states to 152305 states and 266418 transitions. [2019-10-02 12:36:41,655 INFO L78 Accepts]: Start accepts. Automaton has 152305 states and 266418 transitions. Word has length 171 [2019-10-02 12:36:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:41,656 INFO L475 AbstractCegarLoop]: Abstraction has 152305 states and 266418 transitions. [2019-10-02 12:36:41,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:36:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 152305 states and 266418 transitions. [2019-10-02 12:36:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-10-02 12:36:41,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:41,696 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:41,697 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 472348144, now seen corresponding path program 1 times [2019-10-02 12:36:41,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:41,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:41,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-10-02 12:36:42,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:36:42,042 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:36:42,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:42,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 4958 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:36:42,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:36:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-10-02 12:36:43,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:36:43,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-10-02 12:36:43,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:36:43,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:36:43,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:36:43,014 INFO L87 Difference]: Start difference. First operand 152305 states and 266418 transitions. Second operand 13 states. [2019-10-02 12:37:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:49,501 INFO L93 Difference]: Finished difference Result 783187 states and 1789528 transitions. [2019-10-02 12:37:49,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 12:37:49,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 360 [2019-10-02 12:37:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:56,086 INFO L225 Difference]: With dead ends: 783187 [2019-10-02 12:37:56,087 INFO L226 Difference]: Without dead ends: 630971 [2019-10-02 12:38:10,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=690, Invalid=3342, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 12:38:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630971 states. [2019-10-02 12:39:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630971 to 615319. [2019-10-02 12:39:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615319 states.