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_spec2_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:44:29,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:44:29,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:44:29,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:44:29,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:44:29,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:44:29,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:44:29,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:44:29,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:44:29,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:44:29,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:44:29,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:44:29,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:44:29,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:44:29,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:44:29,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:44:29,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:44:29,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:44:29,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:44:29,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:44:29,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:44:29,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:44:29,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:44:29,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:44:29,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:44:29,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:44:29,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:44:29,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:44:29,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:44:29,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:44:29,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:44:29,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:44:29,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:44:29,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:44:29,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:44:29,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:44:29,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:44:29,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:44:29,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:44:29,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:44:29,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:44:29,712 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:44:29,729 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:44:29,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:44:29,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:44:29,729 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:44:29,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:44:29,730 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:44:29,730 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:44:29,731 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:44:29,731 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:44:29,731 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:44:29,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:44:29,732 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:44:29,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:44:29,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:44:29,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:44:29,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:44:29,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:44:29,733 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:44:29,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:44:29,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:44:29,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:44:29,734 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:44:29,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:44:29,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:44:29,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:44:29,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:44:29,735 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:44:29,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:44:29,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:44:29,736 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:44:29,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:44:29,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:44:29,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:44:29,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:44:29,793 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:44:29,794 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product32.cil.c [2019-10-03 02:44:29,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6ea2e88/e6904cf85cf94fbebd386ba65e957d2c/FLAG56f7079c8 [2019-10-03 02:44:30,519 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:44:30,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product32.cil.c [2019-10-03 02:44:30,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6ea2e88/e6904cf85cf94fbebd386ba65e957d2c/FLAG56f7079c8 [2019-10-03 02:44:30,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6ea2e88/e6904cf85cf94fbebd386ba65e957d2c [2019-10-03 02:44:30,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:44:30,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:44:30,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:44:30,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:44:30,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:44:30,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:44:30" (1/1) ... [2019-10-03 02:44:30,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2d3ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:30, skipping insertion in model container [2019-10-03 02:44:30,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:44:30" (1/1) ... [2019-10-03 02:44:30,716 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:44:30,801 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:44:31,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:44:31,592 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:44:31,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:44:31,814 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:44:31,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31 WrapperNode [2019-10-03 02:44:31,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:44:31,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:44:31,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:44:31,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:44:31,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (1/1) ... [2019-10-03 02:44:31,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (1/1) ... [2019-10-03 02:44:31,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (1/1) ... [2019-10-03 02:44:31,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (1/1) ... [2019-10-03 02:44:32,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (1/1) ... [2019-10-03 02:44:32,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (1/1) ... [2019-10-03 02:44:32,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (1/1) ... [2019-10-03 02:44:32,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:44:32,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:44:32,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:44:32,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:44:32,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (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:44:32,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:44:32,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:44:32,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:44:32,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:44:32,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:44:32,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:44:32,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:44:32,135 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:44:32,135 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:44:32,135 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:44:32,135 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:44:32,136 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:44:32,136 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:44:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:44:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:44:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:44:32,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:44:32,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:44:32,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:44:32,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:44:32,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:44:32,140 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:44:32,140 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:44:32,140 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:44:32,140 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:44:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:44:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:44:32,142 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:44:32,142 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:44:32,142 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:44:32,142 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:44:32,142 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:44:32,142 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:44:32,143 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:44:32,143 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:44:32,143 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:44:32,143 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:44:32,143 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:44:32,144 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:44:32,144 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:44:32,144 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:44:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:44:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:44:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:44:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:44:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:44:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:44:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:44:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:44:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:44:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:44:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:44:32,146 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:44:32,147 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:44:32,147 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:44:32,147 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:44:32,147 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:44:32,147 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:44:32,147 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:44:32,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:44:32,148 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:44:32,148 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:44:32,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:44:32,148 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:44:32,148 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:44:32,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:44:32,149 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:44:32,149 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:44:32,149 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:44:32,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:44:32,150 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:44:32,150 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:44:32,150 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:44:32,151 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:44:32,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:44:32,151 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:44:32,152 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-03 02:44:32,152 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:44:32,152 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-03 02:44:32,153 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:44:32,153 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:44:32,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:44:32,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:44:32,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:44:32,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:44:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:44:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:44:32,155 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:44:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:44:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:44:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:44:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:44:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:44:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:44:32,156 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:44:32,157 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:44:32,157 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:44:32,157 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:44:32,157 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:44:32,157 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:44:32,157 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:44:32,157 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:44:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:44:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:44:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:44:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:44:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:44:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:44:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:44:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:44:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:44:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:44:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:44:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:44:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:44:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:44:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:44:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:44:32,161 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:44:32,161 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:44:32,162 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:44:32,162 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:44:32,162 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:44:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:44:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:44:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:44:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:44:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:44:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:44:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:44:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:44:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:44:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:44:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:44:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:44:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:44:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:44:32,166 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:44:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:44:32,170 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:44:32,170 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:44:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:44:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:44:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:44:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:44:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:44:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:44:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:44:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:44:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:44:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:44:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:44:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:44:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:44:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:44:32,172 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:44:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:44:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:44:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:44:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:44:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:44:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:44:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:44:32,174 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:44:32,174 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:44:32,174 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:44:32,174 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:44:32,174 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:44:32,174 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:44:32,174 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:44:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:44:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:44:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:44:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:44:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:44:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-03 02:44:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-03 02:44:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:44:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:44:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:44:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:44:34,427 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:44:34,427 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:44:34,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:44:34 BoogieIcfgContainer [2019-10-03 02:44:34,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:44:34,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:44:34,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:44:34,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:44:34,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:44:30" (1/3) ... [2019-10-03 02:44:34,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bfb768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:44:34, skipping insertion in model container [2019-10-03 02:44:34,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:31" (2/3) ... [2019-10-03 02:44:34,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bfb768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:44:34, skipping insertion in model container [2019-10-03 02:44:34,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:44:34" (3/3) ... [2019-10-03 02:44:34,438 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product32.cil.c [2019-10-03 02:44:34,447 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:44:34,459 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:44:34,476 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:44:34,506 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:44:34,506 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:44:34,506 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:44:34,506 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:44:34,506 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:44:34,507 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:44:34,507 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:44:34,507 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:44:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states. [2019-10-03 02:44:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:44:34,593 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:34,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:34,597 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:34,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2061998394, now seen corresponding path program 1 times [2019-10-03 02:44:34,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:34,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:34,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:35,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:35,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:35,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:35,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:35,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:35,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:35,320 INFO L87 Difference]: Start difference. First operand 833 states. Second operand 4 states. [2019-10-03 02:44:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:35,480 INFO L93 Difference]: Finished difference Result 677 states and 1064 transitions. [2019-10-03 02:44:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:35,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-03 02:44:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:35,513 INFO L225 Difference]: With dead ends: 677 [2019-10-03 02:44:35,513 INFO L226 Difference]: Without dead ends: 666 [2019-10-03 02:44:35,515 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:44:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-03 02:44:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-10-03 02:44:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-10-03 02:44:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1052 transitions. [2019-10-03 02:44:35,653 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1052 transitions. Word has length 85 [2019-10-03 02:44:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:35,654 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1052 transitions. [2019-10-03 02:44:35,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1052 transitions. [2019-10-03 02:44:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:44:35,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:35,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:35,659 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash 190887692, now seen corresponding path program 1 times [2019-10-03 02:44:35,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:35,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:35,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:35,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:35,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:35,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:35,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:35,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:35,903 INFO L87 Difference]: Start difference. First operand 666 states and 1052 transitions. Second operand 4 states. [2019-10-03 02:44:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:36,000 INFO L93 Difference]: Finished difference Result 668 states and 1053 transitions. [2019-10-03 02:44:36,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:36,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-03 02:44:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:36,016 INFO L225 Difference]: With dead ends: 668 [2019-10-03 02:44:36,016 INFO L226 Difference]: Without dead ends: 666 [2019-10-03 02:44:36,019 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:44:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-03 02:44:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-10-03 02:44:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-10-03 02:44:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1051 transitions. [2019-10-03 02:44:36,061 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1051 transitions. Word has length 88 [2019-10-03 02:44:36,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:36,062 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1051 transitions. [2019-10-03 02:44:36,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1051 transitions. [2019-10-03 02:44:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 02:44:36,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:36,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:36,066 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:36,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:36,066 INFO L82 PathProgramCache]: Analyzing trace with hash 594585961, now seen corresponding path program 1 times [2019-10-03 02:44:36,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:36,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:36,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:36,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:36,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:36,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:36,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:36,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:36,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:36,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:36,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:36,275 INFO L87 Difference]: Start difference. First operand 666 states and 1051 transitions. Second operand 4 states. [2019-10-03 02:44:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:36,358 INFO L93 Difference]: Finished difference Result 668 states and 1052 transitions. [2019-10-03 02:44:36,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:36,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-03 02:44:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:36,368 INFO L225 Difference]: With dead ends: 668 [2019-10-03 02:44:36,368 INFO L226 Difference]: Without dead ends: 666 [2019-10-03 02:44:36,368 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:44:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-03 02:44:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-10-03 02:44:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-10-03 02:44:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1050 transitions. [2019-10-03 02:44:36,409 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1050 transitions. Word has length 89 [2019-10-03 02:44:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:36,409 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1050 transitions. [2019-10-03 02:44:36,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1050 transitions. [2019-10-03 02:44:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:44:36,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:36,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:36,412 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 305679912, now seen corresponding path program 1 times [2019-10-03 02:44:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:36,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:36,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:36,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:36,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:36,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:36,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:36,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:36,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:36,609 INFO L87 Difference]: Start difference. First operand 666 states and 1050 transitions. Second operand 4 states. [2019-10-03 02:44:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:36,663 INFO L93 Difference]: Finished difference Result 668 states and 1051 transitions. [2019-10-03 02:44:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:36,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-03 02:44:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:36,673 INFO L225 Difference]: With dead ends: 668 [2019-10-03 02:44:36,673 INFO L226 Difference]: Without dead ends: 666 [2019-10-03 02:44:36,674 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:44:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-03 02:44:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-10-03 02:44:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-10-03 02:44:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1049 transitions. [2019-10-03 02:44:36,699 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1049 transitions. Word has length 90 [2019-10-03 02:44:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:36,700 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1049 transitions. [2019-10-03 02:44:36,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1049 transitions. [2019-10-03 02:44:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:44:36,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:36,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:36,708 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:36,708 INFO L82 PathProgramCache]: Analyzing trace with hash 20876485, now seen corresponding path program 1 times [2019-10-03 02:44:36,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:36,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:36,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:36,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:36,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:36,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:36,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:36,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:36,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:36,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:36,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:36,843 INFO L87 Difference]: Start difference. First operand 666 states and 1049 transitions. Second operand 4 states. [2019-10-03 02:44:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:36,888 INFO L93 Difference]: Finished difference Result 668 states and 1050 transitions. [2019-10-03 02:44:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:36,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:44:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:36,895 INFO L225 Difference]: With dead ends: 668 [2019-10-03 02:44:36,895 INFO L226 Difference]: Without dead ends: 666 [2019-10-03 02:44:36,895 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:44:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-03 02:44:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-10-03 02:44:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-10-03 02:44:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1048 transitions. [2019-10-03 02:44:36,916 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1048 transitions. Word has length 91 [2019-10-03 02:44:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:36,917 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1048 transitions. [2019-10-03 02:44:36,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1048 transitions. [2019-10-03 02:44:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:44:36,920 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:36,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:36,920 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash -136745660, now seen corresponding path program 1 times [2019-10-03 02:44:36,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:36,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:36,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:36,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:37,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:37,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:44:37,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:37,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:44:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:44:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:44:37,133 INFO L87 Difference]: Start difference. First operand 666 states and 1048 transitions. Second operand 10 states. [2019-10-03 02:44:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:37,288 INFO L93 Difference]: Finished difference Result 675 states and 1059 transitions. [2019-10-03 02:44:37,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:44:37,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-03 02:44:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:37,294 INFO L225 Difference]: With dead ends: 675 [2019-10-03 02:44:37,294 INFO L226 Difference]: Without dead ends: 675 [2019-10-03 02:44:37,294 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:44:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-10-03 02:44:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 673. [2019-10-03 02:44:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-10-03 02:44:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1057 transitions. [2019-10-03 02:44:37,324 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1057 transitions. Word has length 92 [2019-10-03 02:44:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:37,325 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-10-03 02:44:37,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:44:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1057 transitions. [2019-10-03 02:44:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:44:37,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:37,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:37,328 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -116408285, now seen corresponding path program 1 times [2019-10-03 02:44:37,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:37,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:37,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:37,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:37,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:37,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:37,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:37,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:37,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:37,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:37,507 INFO L87 Difference]: Start difference. First operand 673 states and 1057 transitions. Second operand 4 states. [2019-10-03 02:44:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:37,546 INFO L93 Difference]: Finished difference Result 671 states and 1052 transitions. [2019-10-03 02:44:37,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:37,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:44:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:37,552 INFO L225 Difference]: With dead ends: 671 [2019-10-03 02:44:37,552 INFO L226 Difference]: Without dead ends: 660 [2019-10-03 02:44:37,552 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:44:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-03 02:44:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-10-03 02:44:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-03 02:44:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1034 transitions. [2019-10-03 02:44:37,573 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1034 transitions. Word has length 92 [2019-10-03 02:44:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:37,574 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1034 transitions. [2019-10-03 02:44:37,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1034 transitions. [2019-10-03 02:44:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:44:37,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:37,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:37,576 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:37,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1615644955, now seen corresponding path program 1 times [2019-10-03 02:44:37,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:37,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:37,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:37,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:37,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:37,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:37,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:37,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:37,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:37,700 INFO L87 Difference]: Start difference. First operand 660 states and 1034 transitions. Second operand 6 states. [2019-10-03 02:44:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:37,910 INFO L93 Difference]: Finished difference Result 663 states and 1037 transitions. [2019-10-03 02:44:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:37,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-03 02:44:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:37,915 INFO L225 Difference]: With dead ends: 663 [2019-10-03 02:44:37,916 INFO L226 Difference]: Without dead ends: 660 [2019-10-03 02:44:37,916 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:44:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-03 02:44:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-10-03 02:44:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-03 02:44:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1030 transitions. [2019-10-03 02:44:37,940 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1030 transitions. Word has length 93 [2019-10-03 02:44:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:37,942 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1030 transitions. [2019-10-03 02:44:37,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1030 transitions. [2019-10-03 02:44:37,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:44:37,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:37,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:37,945 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:37,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash -129454137, now seen corresponding path program 1 times [2019-10-03 02:44:37,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:37,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:38,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:38,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:38,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:38,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:38,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:38,117 INFO L87 Difference]: Start difference. First operand 660 states and 1030 transitions. Second operand 6 states. [2019-10-03 02:44:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:38,314 INFO L93 Difference]: Finished difference Result 663 states and 1033 transitions. [2019-10-03 02:44:38,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:38,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-03 02:44:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:38,321 INFO L225 Difference]: With dead ends: 663 [2019-10-03 02:44:38,321 INFO L226 Difference]: Without dead ends: 660 [2019-10-03 02:44:38,322 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:44:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-03 02:44:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-10-03 02:44:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-03 02:44:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1026 transitions. [2019-10-03 02:44:38,344 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1026 transitions. Word has length 94 [2019-10-03 02:44:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:38,344 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1026 transitions. [2019-10-03 02:44:38,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1026 transitions. [2019-10-03 02:44:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:44:38,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:38,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:38,348 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:38,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:38,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1340975830, now seen corresponding path program 1 times [2019-10-03 02:44:38,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:38,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:38,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:38,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:38,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:38,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:38,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:38,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:38,529 INFO L87 Difference]: Start difference. First operand 660 states and 1026 transitions. Second operand 6 states. [2019-10-03 02:44:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:38,699 INFO L93 Difference]: Finished difference Result 663 states and 1029 transitions. [2019-10-03 02:44:38,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:38,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 02:44:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:38,706 INFO L225 Difference]: With dead ends: 663 [2019-10-03 02:44:38,706 INFO L226 Difference]: Without dead ends: 660 [2019-10-03 02:44:38,706 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:44:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-03 02:44:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-10-03 02:44:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-03 02:44:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1022 transitions. [2019-10-03 02:44:38,728 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1022 transitions. Word has length 95 [2019-10-03 02:44:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:38,729 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1022 transitions. [2019-10-03 02:44:38,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1022 transitions. [2019-10-03 02:44:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:44:38,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:38,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:38,731 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash -293121622, now seen corresponding path program 1 times [2019-10-03 02:44:38,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:38,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:38,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:38,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:38,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:38,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:44:38,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:38,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:44:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:44:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:44:38,859 INFO L87 Difference]: Start difference. First operand 660 states and 1022 transitions. Second operand 7 states. [2019-10-03 02:44:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:38,930 INFO L93 Difference]: Finished difference Result 663 states and 1025 transitions. [2019-10-03 02:44:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:44:38,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-03 02:44:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:38,935 INFO L225 Difference]: With dead ends: 663 [2019-10-03 02:44:38,935 INFO L226 Difference]: Without dead ends: 639 [2019-10-03 02:44:38,936 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:44:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-03 02:44:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-03 02:44:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-03 02:44:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 988 transitions. [2019-10-03 02:44:38,957 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 988 transitions. Word has length 95 [2019-10-03 02:44:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:38,958 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 988 transitions. [2019-10-03 02:44:38,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:44:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 988 transitions. [2019-10-03 02:44:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:44:38,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:38,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:38,960 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash -282239444, now seen corresponding path program 1 times [2019-10-03 02:44:38,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:38,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:38,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:39,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:39,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:39,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:39,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:39,082 INFO L87 Difference]: Start difference. First operand 639 states and 988 transitions. Second operand 6 states. [2019-10-03 02:44:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:39,199 INFO L93 Difference]: Finished difference Result 642 states and 991 transitions. [2019-10-03 02:44:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:39,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:44:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:39,205 INFO L225 Difference]: With dead ends: 642 [2019-10-03 02:44:39,205 INFO L226 Difference]: Without dead ends: 639 [2019-10-03 02:44:39,206 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:44:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-03 02:44:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-03 02:44:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-03 02:44:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 987 transitions. [2019-10-03 02:44:39,229 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 987 transitions. Word has length 96 [2019-10-03 02:44:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:39,229 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 987 transitions. [2019-10-03 02:44:39,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 987 transitions. [2019-10-03 02:44:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:44:39,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:39,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:39,232 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1859946641, now seen corresponding path program 1 times [2019-10-03 02:44:39,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:39,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:39,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:39,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:39,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:39,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:39,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:39,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:39,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:39,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:39,384 INFO L87 Difference]: Start difference. First operand 639 states and 987 transitions. Second operand 6 states. [2019-10-03 02:44:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:39,492 INFO L93 Difference]: Finished difference Result 642 states and 990 transitions. [2019-10-03 02:44:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:39,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-03 02:44:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:39,499 INFO L225 Difference]: With dead ends: 642 [2019-10-03 02:44:39,500 INFO L226 Difference]: Without dead ends: 639 [2019-10-03 02:44:39,500 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:44:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-03 02:44:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-03 02:44:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-03 02:44:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 986 transitions. [2019-10-03 02:44:39,596 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 986 transitions. Word has length 97 [2019-10-03 02:44:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:39,597 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 986 transitions. [2019-10-03 02:44:39,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 986 transitions. [2019-10-03 02:44:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:44:39,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:39,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:39,599 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:39,599 INFO L82 PathProgramCache]: Analyzing trace with hash 731941009, now seen corresponding path program 1 times [2019-10-03 02:44:39,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:39,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:39,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:39,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:44:39,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:39,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:44:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:44:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:44:39,793 INFO L87 Difference]: Start difference. First operand 639 states and 986 transitions. Second operand 12 states. [2019-10-03 02:44:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:39,964 INFO L93 Difference]: Finished difference Result 643 states and 989 transitions. [2019-10-03 02:44:39,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:44:39,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-03 02:44:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:39,969 INFO L225 Difference]: With dead ends: 643 [2019-10-03 02:44:39,970 INFO L226 Difference]: Without dead ends: 639 [2019-10-03 02:44:39,970 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:44:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-03 02:44:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-03 02:44:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-03 02:44:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 985 transitions. [2019-10-03 02:44:39,989 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 985 transitions. Word has length 98 [2019-10-03 02:44:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:39,989 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 985 transitions. [2019-10-03 02:44:39,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:44:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 985 transitions. [2019-10-03 02:44:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:44:39,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:39,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:39,991 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:39,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2083976240, now seen corresponding path program 1 times [2019-10-03 02:44:39,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:39,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:39,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:39,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:39,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:40,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:40,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:40,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:40,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:40,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:40,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:40,160 INFO L87 Difference]: Start difference. First operand 639 states and 985 transitions. Second operand 6 states. [2019-10-03 02:44:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:44,299 INFO L93 Difference]: Finished difference Result 1308 states and 2069 transitions. [2019-10-03 02:44:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:44,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-03 02:44:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:44,312 INFO L225 Difference]: With dead ends: 1308 [2019-10-03 02:44:44,312 INFO L226 Difference]: Without dead ends: 1308 [2019-10-03 02:44:44,314 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-10-03 02:44:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1181. [2019-10-03 02:44:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-10-03 02:44:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1867 transitions. [2019-10-03 02:44:44,364 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1867 transitions. Word has length 99 [2019-10-03 02:44:44,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:44,364 INFO L475 AbstractCegarLoop]: Abstraction has 1181 states and 1867 transitions. [2019-10-03 02:44:44,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1867 transitions. [2019-10-03 02:44:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:44:44,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:44,370 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:44,370 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1126166242, now seen corresponding path program 1 times [2019-10-03 02:44:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:44,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:44,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:44,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:44,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:44,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:44:44,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:44,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:44:44,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:44:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:44:44,605 INFO L87 Difference]: Start difference. First operand 1181 states and 1867 transitions. Second operand 12 states. [2019-10-03 02:44:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:56,548 INFO L93 Difference]: Finished difference Result 2751 states and 4300 transitions. [2019-10-03 02:44:56,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:44:56,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-10-03 02:44:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:56,566 INFO L225 Difference]: With dead ends: 2751 [2019-10-03 02:44:56,567 INFO L226 Difference]: Without dead ends: 2751 [2019-10-03 02:44:56,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-03 02:44:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-10-03 02:44:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2693. [2019-10-03 02:44:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2019-10-03 02:44:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4220 transitions. [2019-10-03 02:44:56,675 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4220 transitions. Word has length 157 [2019-10-03 02:44:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:56,676 INFO L475 AbstractCegarLoop]: Abstraction has 2693 states and 4220 transitions. [2019-10-03 02:44:56,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:44:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4220 transitions. [2019-10-03 02:44:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:44:56,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:56,685 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:56,685 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash -525779042, now seen corresponding path program 1 times [2019-10-03 02:44:56,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:56,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:56,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:56,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 02:44:56,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:44:56,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:44:56,914 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-10-03 02:44:56,917 INFO L207 CegarAbsIntRunner]: [218], [220], [222], [237], [256], [258], [261], [263], [267], [709], [711], [730], [750], [770], [790], [810], [812], [841], [842], [843], [845], [848], [853], [861], [864], [926], [927], [1009], [1010], [1304], [1305], [1378], [1382], [1385], [1420], [1422], [1423], [1431], [1438], [1440], [1449], [1451], [1464], [1477], [1482], [1483], [1484], [1489], [1569], [1571], [1574], [1576], [1582], [1586], [1587], [1623], [1626], [1631], [1636], [1641], [1646], [1651], [1654], [1770], [1779], [1784], [1787], [1806], [1995], [1999], [2003], [2007], [2011], [2015], [2018], [2020], [2021], [2034], [2037], [2043], [2047], [2274], [2278], [2281], [2299], [2391], [2393], [2490], [2493], [2498], [2501], [2519], [2538], [2539], [2540], [2541], [2570], [2571], [2572], [2573], [2620], [2621], [2632], [2633], [2634], [2635], [2638], [2639], [2640], [2804], [2805], [2806], [2807], [2808], [2809], [2810], [2811], [2812], [2818], [2819], [2824], [2825], [2826], [2827], [2828], [2829], [2844], [2845], [2846], [2847], [2852], [2853], [2860], [2861], [2862], [2863], [2864], [2874], [2875], [2876], [2890], [2891], [2920], [2921], [2922], [2923] [2019-10-03 02:44:56,967 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:44:56,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:44:57,060 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:44:57,062 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 184 root evaluator evaluations with a maximum evaluation depth of 0. Performed 184 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 270 variables. [2019-10-03 02:44:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:57,067 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:44:57,128 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:44:57,129 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:44:57,133 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-10-03 02:44:57,134 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:44:57,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:44:57,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:44:57,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:57,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:44:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:44:57,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:44:57,136 INFO L87 Difference]: Start difference. First operand 2693 states and 4220 transitions. Second operand 2 states. [2019-10-03 02:44:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:57,137 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:44:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:44:57,137 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-03 02:44:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:57,137 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:44:57,137 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:44:57,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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:44:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:44:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:44:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:44:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:44:57,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2019-10-03 02:44:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:57,139 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:44:57,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:44:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:44:57,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:44:57,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:44:57 BoogieIcfgContainer [2019-10-03 02:44:57,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:44:57,150 INFO L168 Benchmark]: Toolchain (without parser) took 26447.91 ms. Allocated memory was 141.0 MB in the beginning and 615.0 MB in the end (delta: 474.0 MB). Free memory was 85.0 MB in the beginning and 343.8 MB in the end (delta: -258.8 MB). Peak memory consumption was 215.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:57,151 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 02:44:57,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1115.66 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 85.0 MB in the beginning and 135.8 MB in the end (delta: -50.8 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:57,156 INFO L168 Benchmark]: Boogie Preprocessor took 245.38 ms. Allocated memory is still 201.9 MB. Free memory was 135.8 MB in the beginning and 126.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:57,157 INFO L168 Benchmark]: RCFGBuilder took 2368.12 ms. Allocated memory was 201.9 MB in the beginning and 262.1 MB in the end (delta: 60.3 MB). Free memory was 126.5 MB in the beginning and 125.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:57,159 INFO L168 Benchmark]: TraceAbstraction took 22714.28 ms. Allocated memory was 262.1 MB in the beginning and 615.0 MB in the end (delta: 352.8 MB). Free memory was 125.0 MB in the beginning and 343.8 MB in the end (delta: -218.8 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:57,168 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1115.66 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 85.0 MB in the beginning and 135.8 MB in the end (delta: -50.8 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 245.38 ms. Allocated memory is still 201.9 MB. Free memory was 135.8 MB in the beginning and 126.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2368.12 ms. Allocated memory was 201.9 MB in the beginning and 262.1 MB in the end (delta: 60.3 MB). Free memory was 126.5 MB in the beginning and 125.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22714.28 ms. Allocated memory was 262.1 MB in the beginning and 615.0 MB in the end (delta: 352.8 MB). Free memory was 125.0 MB in the beginning and 343.8 MB in the end (delta: -218.8 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1886]: 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 83 procedures, 963 locations, 1 error locations. SAFE Result, 22.6s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16842 SDtfs, 5210 SDslu, 56732 SDs, 0 SdLazy, 17118 SolverSat, 1726 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2693occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.605095541401274 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1692 ConstructedInterpolants, 0 QuantifiedInterpolants, 271159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 31/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...