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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:39:38,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:39:38,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:39:38,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:39:38,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:39:38,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:39:38,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:39:38,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:39:38,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:39:38,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:39:38,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:39:38,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:39:38,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:39:38,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:39:38,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:39:38,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:39:38,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:39:38,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:39:38,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:39:38,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:39:38,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:39:38,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:39:38,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:39:38,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:39:38,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:39:38,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:39:38,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:39:38,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:39:38,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:39:38,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:39:38,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:39:38,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:39:38,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:39:38,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:39:38,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:39:38,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:39:38,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:39:38,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:39:38,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:39:38,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:39:38,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:39:38,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:39:38,646 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:39:38,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:39:38,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:39:38,647 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:39:38,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:39:38,648 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:39:38,648 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:39:38,649 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:39:38,649 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:39:38,649 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:39:38,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:39:38,650 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:39:38,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:39:38,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:39:38,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:39:38,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:39:38,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:39:38,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:39:38,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:39:38,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:39:38,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:39:38,652 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:39:38,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:39:38,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:39:38,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:39:38,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:39:38,653 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:39:38,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:39:38,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:39:38,654 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:39:38,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:39:38,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:39:38,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:39:38,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:39:38,709 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:39:38,711 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product24.cil.c [2019-10-03 02:39:38,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796aa339d/34fa69a75bd844bca047d6fa6f972d88/FLAG33c3cc9b1 [2019-10-03 02:39:39,473 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:39:39,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product24.cil.c [2019-10-03 02:39:39,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796aa339d/34fa69a75bd844bca047d6fa6f972d88/FLAG33c3cc9b1 [2019-10-03 02:39:39,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/796aa339d/34fa69a75bd844bca047d6fa6f972d88 [2019-10-03 02:39:39,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:39:39,715 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:39:39,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:39,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:39:39,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:39:39,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:39" (1/1) ... [2019-10-03 02:39:39,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4bc8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:39, skipping insertion in model container [2019-10-03 02:39:39,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:39" (1/1) ... [2019-10-03 02:39:39,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:39:39,809 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:39:40,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:40,500 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:39:40,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:40,811 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:39:40,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40 WrapperNode [2019-10-03 02:39:40,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:40,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:39:40,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:39:40,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:39:40,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (1/1) ... [2019-10-03 02:39:40,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (1/1) ... [2019-10-03 02:39:40,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (1/1) ... [2019-10-03 02:39:40,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (1/1) ... [2019-10-03 02:39:40,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (1/1) ... [2019-10-03 02:39:41,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (1/1) ... [2019-10-03 02:39:41,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (1/1) ... [2019-10-03 02:39:41,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:39:41,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:39:41,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:39:41,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:39:41,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (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-03 02:39:41,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:39:41,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:39:41,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:41,106 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:39:41,106 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:39:41,107 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:39:41,107 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:39:41,107 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:39:41,107 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:39:41,107 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:39:41,107 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:39:41,108 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:39:41,108 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:39:41,108 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:39:41,108 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:39:41,109 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:39:41,109 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:39:41,109 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:39:41,109 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:39:41,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:39:41,109 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:39:41,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:39:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:39:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:39:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:39:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:39:41,111 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:39:41,112 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:39:41,112 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:39:41,112 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:39:41,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:39:41,112 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:39:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:39:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:39:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:39:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:39:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:39:41,113 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:39:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:39:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:39:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:39:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:39:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:39:41,115 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:39:41,115 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:41,115 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:39:41,115 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:39:41,115 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-03 02:39:41,116 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:39:41,116 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-03 02:39:41,116 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:39:41,116 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:39:41,116 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:39:41,116 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:39:41,117 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:39:41,117 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:39:41,117 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:39:41,117 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:39:41,117 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:39:41,117 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:39:41,118 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:39:41,118 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:39:41,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:41,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:41,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:39:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:39:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:39:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:39:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:39:41,119 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:39:41,120 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:39:41,120 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:39:41,120 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:39:41,120 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:39:41,120 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:39:41,121 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:39:41,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:39:41,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:39:41,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:39:41,121 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:39:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:39:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:39:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:39:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:39:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:39:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:39:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:39:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:39:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:39:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:39:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:39:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:39:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:39:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:39:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:39:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:39:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:39:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:39:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:39:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:39:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:39:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:39:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:39:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:39:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:39:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:39:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:39:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:39:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:39:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:39:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:39:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:39:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:39:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:39:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:39:41,127 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:39:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:39:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:39:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:39:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:39:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:39:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:39:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:39:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:39:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:39:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:39:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:39:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:39:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:39:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:39:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:39:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:39:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:39:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:39:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:39:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:39:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:39:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:39:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:39:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:39:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:39:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:39:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-03 02:39:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-03 02:39:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:39:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:39:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:39:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:39:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:39:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:39:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:39:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:39:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:39:41,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:39:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:39:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:39:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:39:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:39:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:39:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:39:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:39:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:39:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:39:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:39:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:39:43,484 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:39:43,484 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:39:43,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:43 BoogieIcfgContainer [2019-10-03 02:39:43,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:39:43,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:39:43,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:39:43,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:39:43,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:39:39" (1/3) ... [2019-10-03 02:39:43,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d84abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:43, skipping insertion in model container [2019-10-03 02:39:43,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:40" (2/3) ... [2019-10-03 02:39:43,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d84abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:43, skipping insertion in model container [2019-10-03 02:39:43,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:43" (3/3) ... [2019-10-03 02:39:43,497 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product24.cil.c [2019-10-03 02:39:43,509 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:39:43,521 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:39:43,539 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:39:43,573 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:39:43,573 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:39:43,573 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:39:43,574 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:39:43,574 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:39:43,574 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:39:43,574 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:39:43,574 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:39:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states. [2019-10-03 02:39:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:39:43,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:43,650 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:43,652 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1147677768, now seen corresponding path program 1 times [2019-10-03 02:39:43,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:43,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:43,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:44,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:44,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:44,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:44,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:44,308 INFO L87 Difference]: Start difference. First operand 782 states. Second operand 4 states. [2019-10-03 02:39:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:44,546 INFO L93 Difference]: Finished difference Result 638 states and 998 transitions. [2019-10-03 02:39:44,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:44,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-03 02:39:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:44,585 INFO L225 Difference]: With dead ends: 638 [2019-10-03 02:39:44,585 INFO L226 Difference]: Without dead ends: 627 [2019-10-03 02:39:44,588 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-03 02:39:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-03 02:39:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-03 02:39:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-03 02:39:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 984 transitions. [2019-10-03 02:39:44,717 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 984 transitions. Word has length 87 [2019-10-03 02:39:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:44,718 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 984 transitions. [2019-10-03 02:39:44,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 984 transitions. [2019-10-03 02:39:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:39:44,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:44,727 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:44,727 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:44,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 169764925, now seen corresponding path program 1 times [2019-10-03 02:39:44,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:44,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:44,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:44,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:44,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:44,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:44,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:44,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:44,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:44,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:44,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:44,964 INFO L87 Difference]: Start difference. First operand 627 states and 984 transitions. Second operand 4 states. [2019-10-03 02:39:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:45,043 INFO L93 Difference]: Finished difference Result 629 states and 985 transitions. [2019-10-03 02:39:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:45,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-03 02:39:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:45,053 INFO L225 Difference]: With dead ends: 629 [2019-10-03 02:39:45,053 INFO L226 Difference]: Without dead ends: 627 [2019-10-03 02:39:45,055 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-03 02:39:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-03 02:39:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-03 02:39:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-03 02:39:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 983 transitions. [2019-10-03 02:39:45,109 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 983 transitions. Word has length 88 [2019-10-03 02:39:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:45,110 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 983 transitions. [2019-10-03 02:39:45,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 983 transitions. [2019-10-03 02:39:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 02:39:45,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:45,121 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:45,121 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1535536684, now seen corresponding path program 1 times [2019-10-03 02:39:45,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:45,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:45,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:45,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:45,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:45,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:45,274 INFO L87 Difference]: Start difference. First operand 627 states and 983 transitions. Second operand 4 states. [2019-10-03 02:39:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:45,337 INFO L93 Difference]: Finished difference Result 629 states and 984 transitions. [2019-10-03 02:39:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:45,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-03 02:39:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:45,342 INFO L225 Difference]: With dead ends: 629 [2019-10-03 02:39:45,342 INFO L226 Difference]: Without dead ends: 627 [2019-10-03 02:39:45,343 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-03 02:39:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-03 02:39:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-03 02:39:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-03 02:39:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 982 transitions. [2019-10-03 02:39:45,366 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 982 transitions. Word has length 89 [2019-10-03 02:39:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:45,366 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 982 transitions. [2019-10-03 02:39:45,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 982 transitions. [2019-10-03 02:39:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:39:45,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:45,369 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:45,369 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1838336153, now seen corresponding path program 1 times [2019-10-03 02:39:45,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:45,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:45,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:45,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:45,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:45,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:45,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:45,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:45,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:45,497 INFO L87 Difference]: Start difference. First operand 627 states and 982 transitions. Second operand 4 states. [2019-10-03 02:39:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:45,575 INFO L93 Difference]: Finished difference Result 629 states and 983 transitions. [2019-10-03 02:39:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:45,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-03 02:39:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:45,590 INFO L225 Difference]: With dead ends: 629 [2019-10-03 02:39:45,590 INFO L226 Difference]: Without dead ends: 627 [2019-10-03 02:39:45,591 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-03 02:39:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-03 02:39:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-03 02:39:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-03 02:39:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 981 transitions. [2019-10-03 02:39:45,620 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 981 transitions. Word has length 90 [2019-10-03 02:39:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:45,620 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 981 transitions. [2019-10-03 02:39:45,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 981 transitions. [2019-10-03 02:39:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:39:45,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:45,622 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:45,622 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash -542140432, now seen corresponding path program 1 times [2019-10-03 02:39:45,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:45,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:45,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:45,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:45,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:45,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:45,802 INFO L87 Difference]: Start difference. First operand 627 states and 981 transitions. Second operand 4 states. [2019-10-03 02:39:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:45,856 INFO L93 Difference]: Finished difference Result 629 states and 982 transitions. [2019-10-03 02:39:45,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:45,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:39:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:45,866 INFO L225 Difference]: With dead ends: 629 [2019-10-03 02:39:45,866 INFO L226 Difference]: Without dead ends: 627 [2019-10-03 02:39:45,867 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-03 02:39:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-03 02:39:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-03 02:39:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-03 02:39:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 980 transitions. [2019-10-03 02:39:45,892 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 980 transitions. Word has length 91 [2019-10-03 02:39:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:45,892 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 980 transitions. [2019-10-03 02:39:45,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 980 transitions. [2019-10-03 02:39:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:39:45,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:45,894 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:45,894 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -918822667, now seen corresponding path program 1 times [2019-10-03 02:39:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:46,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:46,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:39:46,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:46,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:39:46,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:39:46,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:39:46,094 INFO L87 Difference]: Start difference. First operand 627 states and 980 transitions. Second operand 10 states. [2019-10-03 02:39:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:46,279 INFO L93 Difference]: Finished difference Result 636 states and 992 transitions. [2019-10-03 02:39:46,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:39:46,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-03 02:39:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:46,285 INFO L225 Difference]: With dead ends: 636 [2019-10-03 02:39:46,286 INFO L226 Difference]: Without dead ends: 636 [2019-10-03 02:39:46,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:39:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-10-03 02:39:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2019-10-03 02:39:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-03 02:39:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 990 transitions. [2019-10-03 02:39:46,318 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 990 transitions. Word has length 92 [2019-10-03 02:39:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:46,319 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 990 transitions. [2019-10-03 02:39:46,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:39:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 990 transitions. [2019-10-03 02:39:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:39:46,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:46,323 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:46,323 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash -817910700, now seen corresponding path program 1 times [2019-10-03 02:39:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:46,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:46,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:46,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:46,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:46,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:46,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:46,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:46,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:46,447 INFO L87 Difference]: Start difference. First operand 634 states and 990 transitions. Second operand 4 states. [2019-10-03 02:39:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:46,512 INFO L93 Difference]: Finished difference Result 632 states and 985 transitions. [2019-10-03 02:39:46,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:46,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:39:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:46,520 INFO L225 Difference]: With dead ends: 632 [2019-10-03 02:39:46,521 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:39:46,521 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-03 02:39:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:39:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:39:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:39:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 983 transitions. [2019-10-03 02:39:46,547 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 983 transitions. Word has length 92 [2019-10-03 02:39:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:46,548 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 983 transitions. [2019-10-03 02:39:46,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 983 transitions. [2019-10-03 02:39:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:39:46,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:46,551 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:46,552 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1716994026, now seen corresponding path program 1 times [2019-10-03 02:39:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:46,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:46,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:46,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:46,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:46,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:46,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:46,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:46,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:46,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:46,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:46,705 INFO L87 Difference]: Start difference. First operand 630 states and 983 transitions. Second operand 6 states. [2019-10-03 02:39:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:47,060 INFO L93 Difference]: Finished difference Result 647 states and 1004 transitions. [2019-10-03 02:39:47,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:39:47,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-03 02:39:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:47,068 INFO L225 Difference]: With dead ends: 647 [2019-10-03 02:39:47,068 INFO L226 Difference]: Without dead ends: 638 [2019-10-03 02:39:47,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-03 02:39:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2019-10-03 02:39:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-03 02:39:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 984 transitions. [2019-10-03 02:39:47,115 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 984 transitions. Word has length 93 [2019-10-03 02:39:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:47,115 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 984 transitions. [2019-10-03 02:39:47,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 984 transitions. [2019-10-03 02:39:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:39:47,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:47,118 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:47,119 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:47,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash 466217464, now seen corresponding path program 1 times [2019-10-03 02:39:47,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:47,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:47,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:47,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:47,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:47,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:47,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:47,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:47,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:47,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:47,268 INFO L87 Difference]: Start difference. First operand 635 states and 984 transitions. Second operand 6 states. [2019-10-03 02:39:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:47,503 INFO L93 Difference]: Finished difference Result 638 states and 987 transitions. [2019-10-03 02:39:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:47,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-03 02:39:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:47,509 INFO L225 Difference]: With dead ends: 638 [2019-10-03 02:39:47,510 INFO L226 Difference]: Without dead ends: 635 [2019-10-03 02:39:47,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-03 02:39:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-03 02:39:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-03 02:39:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 980 transitions. [2019-10-03 02:39:47,534 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 980 transitions. Word has length 94 [2019-10-03 02:39:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:47,535 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 980 transitions. [2019-10-03 02:39:47,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 980 transitions. [2019-10-03 02:39:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:39:47,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:47,538 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:47,538 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1611435045, now seen corresponding path program 1 times [2019-10-03 02:39:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:47,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:47,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:47,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:47,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:47,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:47,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:47,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:47,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:47,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:47,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:47,687 INFO L87 Difference]: Start difference. First operand 635 states and 980 transitions. Second operand 6 states. [2019-10-03 02:39:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:47,949 INFO L93 Difference]: Finished difference Result 638 states and 983 transitions. [2019-10-03 02:39:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:47,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 02:39:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:47,955 INFO L225 Difference]: With dead ends: 638 [2019-10-03 02:39:47,955 INFO L226 Difference]: Without dead ends: 635 [2019-10-03 02:39:47,955 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-03 02:39:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-03 02:39:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-03 02:39:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 976 transitions. [2019-10-03 02:39:47,980 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 976 transitions. Word has length 95 [2019-10-03 02:39:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:47,981 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 976 transitions. [2019-10-03 02:39:47,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 976 transitions. [2019-10-03 02:39:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:39:47,983 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:47,983 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:47,984 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:47,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1788227675, now seen corresponding path program 1 times [2019-10-03 02:39:47,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:47,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:47,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:47,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:47,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:48,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:48,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:39:48,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:48,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:39:48,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:39:48,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:39:48,161 INFO L87 Difference]: Start difference. First operand 635 states and 976 transitions. Second operand 7 states. [2019-10-03 02:39:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:48,260 INFO L93 Difference]: Finished difference Result 641 states and 983 transitions. [2019-10-03 02:39:48,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:39:48,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-03 02:39:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:48,266 INFO L225 Difference]: With dead ends: 641 [2019-10-03 02:39:48,266 INFO L226 Difference]: Without dead ends: 617 [2019-10-03 02:39:48,267 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-03 02:39:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-03 02:39:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2019-10-03 02:39:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-03 02:39:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 939 transitions. [2019-10-03 02:39:48,286 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 939 transitions. Word has length 95 [2019-10-03 02:39:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:48,287 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 939 transitions. [2019-10-03 02:39:48,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:39:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 939 transitions. [2019-10-03 02:39:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:39:48,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:48,289 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:48,289 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:48,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1663081949, now seen corresponding path program 1 times [2019-10-03 02:39:48,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:48,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:48,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:48,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:48,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:48,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:48,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:48,407 INFO L87 Difference]: Start difference. First operand 614 states and 939 transitions. Second operand 6 states. [2019-10-03 02:39:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:48,559 INFO L93 Difference]: Finished difference Result 617 states and 942 transitions. [2019-10-03 02:39:48,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:48,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:39:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:48,566 INFO L225 Difference]: With dead ends: 617 [2019-10-03 02:39:48,566 INFO L226 Difference]: Without dead ends: 614 [2019-10-03 02:39:48,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-03 02:39:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-03 02:39:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-03 02:39:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 938 transitions. [2019-10-03 02:39:48,596 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 938 transitions. Word has length 96 [2019-10-03 02:39:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:48,597 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 938 transitions. [2019-10-03 02:39:48,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 938 transitions. [2019-10-03 02:39:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:39:48,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:48,600 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:48,600 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash -943838304, now seen corresponding path program 1 times [2019-10-03 02:39:48,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:48,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:48,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:48,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:48,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:48,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:48,763 INFO L87 Difference]: Start difference. First operand 614 states and 938 transitions. Second operand 6 states. [2019-10-03 02:39:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:48,931 INFO L93 Difference]: Finished difference Result 617 states and 941 transitions. [2019-10-03 02:39:48,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:48,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-03 02:39:48,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:48,938 INFO L225 Difference]: With dead ends: 617 [2019-10-03 02:39:48,939 INFO L226 Difference]: Without dead ends: 614 [2019-10-03 02:39:48,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-03 02:39:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-03 02:39:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-03 02:39:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 937 transitions. [2019-10-03 02:39:48,964 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 937 transitions. Word has length 97 [2019-10-03 02:39:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:48,965 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 937 transitions. [2019-10-03 02:39:48,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 937 transitions. [2019-10-03 02:39:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:39:48,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:48,967 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:48,967 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1191719486, now seen corresponding path program 1 times [2019-10-03 02:39:48,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:48,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:48,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:48,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:48,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:49,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:49,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:39:49,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:49,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:39:49,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:39:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:39:49,180 INFO L87 Difference]: Start difference. First operand 614 states and 937 transitions. Second operand 12 states. [2019-10-03 02:39:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:49,451 INFO L93 Difference]: Finished difference Result 623 states and 947 transitions. [2019-10-03 02:39:49,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:39:49,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-03 02:39:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:49,457 INFO L225 Difference]: With dead ends: 623 [2019-10-03 02:39:49,457 INFO L226 Difference]: Without dead ends: 621 [2019-10-03 02:39:49,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:39:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-03 02:39:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 619. [2019-10-03 02:39:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-03 02:39:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 943 transitions. [2019-10-03 02:39:49,486 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 943 transitions. Word has length 98 [2019-10-03 02:39:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:49,486 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 943 transitions. [2019-10-03 02:39:49,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:39:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 943 transitions. [2019-10-03 02:39:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:39:49,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:49,488 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:39:49,488 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:49,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:49,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1942578085, now seen corresponding path program 1 times [2019-10-03 02:39:49,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:49,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:49,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:49,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:49,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:39:49,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:49,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:39:49,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:39:49,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:49,691 INFO L87 Difference]: Start difference. First operand 619 states and 943 transitions. Second operand 3 states. [2019-10-03 02:39:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:49,858 INFO L93 Difference]: Finished difference Result 1181 states and 1834 transitions. [2019-10-03 02:39:49,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:39:49,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-03 02:39:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:49,869 INFO L225 Difference]: With dead ends: 1181 [2019-10-03 02:39:49,870 INFO L226 Difference]: Without dead ends: 1181 [2019-10-03 02:39:49,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-03 02:39:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-10-03 02:39:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1111. [2019-10-03 02:39:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-03 02:39:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1724 transitions. [2019-10-03 02:39:49,919 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1724 transitions. Word has length 99 [2019-10-03 02:39:49,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:49,920 INFO L475 AbstractCegarLoop]: Abstraction has 1111 states and 1724 transitions. [2019-10-03 02:39:49,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:39:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1724 transitions. [2019-10-03 02:39:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:39:49,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:49,927 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 02:39:49,927 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 821563057, now seen corresponding path program 1 times [2019-10-03 02:39:49,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:49,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:49,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:49,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:49,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-03 02:39:50,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:50,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:50,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-10-03 02:39:50,134 INFO L207 CegarAbsIntRunner]: [72], [73], [152], [156], [159], [350], [352], [354], [405], [406], [408], [409], [428], [430], [433], [435], [439], [567], [569], [581], [630], [631], [632], [637], [704], [705], [737], [739], [742], [744], [750], [754], [755], [791], [794], [799], [804], [809], [814], [819], [822], [938], [943], [944], [951], [956], [959], [978], [1205], [1209], [1213], [1217], [1221], [1225], [1228], [1230], [1231], [1244], [1249], [1253], [1257], [1273], [1275], [1278], [1280], [1282], [1287], [1289], [1292], [1398], [1399], [1664], [2009], [2012], [2030], [2241], [2243], [2340], [2343], [2348], [2351], [2369], [2422], [2423], [2424], [2425], [2426], [2427], [2428], [2429], [2430], [2440], [2441], [2442], [2443], [2468], [2469], [2478], [2479], [2480], [2481], [2488], [2489], [2490], [2518], [2519], [2522], [2523], [2524], [2544], [2545], [2546], [2547], [2552], [2553], [2554], [2560], [2586], [2587], [2588], [2589], [2590], [2591], [2592], [2593], [2594], [2640], [2641], [2642], [2722], [2723], [2752], [2753], [2754], [2755] [2019-10-03 02:39:50,198 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:39:50,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:39:50,334 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:39:50,337 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 152 root evaluator evaluations with a maximum evaluation depth of 0. Performed 152 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 260 variables. [2019-10-03 02:39:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:50,342 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:39:50,442 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:39:50,442 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:39:50,454 INFO L420 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2019-10-03 02:39:50,455 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:39:50,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:39:50,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-10-03 02:39:50,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:50,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:39:50,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:39:50,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:50,457 INFO L87 Difference]: Start difference. First operand 1111 states and 1724 transitions. Second operand 2 states. [2019-10-03 02:39:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:50,458 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:39:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:39:50,458 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 157 [2019-10-03 02:39:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:50,458 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:39:50,459 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:39:50,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:39:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:39:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:39:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:39:50,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2019-10-03 02:39:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:50,460 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:39:50,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:39:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:39:50,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:39:50,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:39:50 BoogieIcfgContainer [2019-10-03 02:39:50,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:39:50,470 INFO L168 Benchmark]: Toolchain (without parser) took 10753.46 ms. Allocated memory was 138.4 MB in the beginning and 424.7 MB in the end (delta: 286.3 MB). Free memory was 82.4 MB in the beginning and 221.4 MB in the end (delta: -139.0 MB). Peak memory consumption was 147.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:50,472 INFO L168 Benchmark]: CDTParser took 1.32 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:39:50,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1096.46 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 82.2 MB in the beginning and 135.2 MB in the end (delta: -53.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:50,478 INFO L168 Benchmark]: Boogie Preprocessor took 214.31 ms. Allocated memory is still 200.3 MB. Free memory was 135.2 MB in the beginning and 125.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:50,479 INFO L168 Benchmark]: RCFGBuilder took 2459.37 ms. Allocated memory was 200.3 MB in the beginning and 272.6 MB in the end (delta: 72.4 MB). Free memory was 125.8 MB in the beginning and 152.2 MB in the end (delta: -26.5 MB). Peak memory consumption was 88.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:50,481 INFO L168 Benchmark]: TraceAbstraction took 6978.26 ms. Allocated memory was 272.6 MB in the beginning and 424.7 MB in the end (delta: 152.0 MB). Free memory was 152.2 MB in the beginning and 221.4 MB in the end (delta: -69.2 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:50,493 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1096.46 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 82.2 MB in the beginning and 135.2 MB in the end (delta: -53.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 214.31 ms. Allocated memory is still 200.3 MB. Free memory was 135.2 MB in the beginning and 125.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2459.37 ms. Allocated memory was 200.3 MB in the beginning and 272.6 MB in the end (delta: 72.4 MB). Free memory was 125.8 MB in the beginning and 152.2 MB in the end (delta: -26.5 MB). Peak memory consumption was 88.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6978.26 ms. Allocated memory was 272.6 MB in the beginning and 424.7 MB in the end (delta: 152.0 MB). Free memory was 152.2 MB in the beginning and 221.4 MB in the end (delta: -69.2 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3378]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 79 procedures, 917 locations, 1 error locations. SAFE Result, 6.9s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14272 SDtfs, 1428 SDslu, 51744 SDs, 0 SdLazy, 1725 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1111occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.6153846153846154 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 80 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1553 NumberOfCodeBlocks, 1553 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1537 ConstructedInterpolants, 0 QuantifiedInterpolants, 205075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 82/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...