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_spec3_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:45:53,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:45:53,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:45:53,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:45:53,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:45:53,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:45:53,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:45:53,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:45:53,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:45:53,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:45:53,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:45:53,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:45:53,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:45:53,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:45:53,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:45:53,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:45:53,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:45:53,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:45:53,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:45:53,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:45:53,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:45:53,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:45:53,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:45:53,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:45:53,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:45:53,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:45:53,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:45:53,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:45:53,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:45:53,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:45:53,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:45:53,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:45:53,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:45:53,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:45:53,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:45:53,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:45:53,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:45:53,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:45:53,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:45:53,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:45:53,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:45:53,537 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:45:53,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:45:53,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:45:53,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:45:53,554 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:45:53,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:45:53,555 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:45:53,555 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:45:53,555 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:45:53,556 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:45:53,556 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:45:53,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:45:53,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:45:53,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:45:53,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:45:53,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:45:53,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:45:53,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:45:53,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:45:53,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:45:53,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:45:53,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:45:53,559 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:45:53,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:45:53,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:45:53,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:45:53,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:45:53,560 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:45:53,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:45:53,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:45:53,561 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:45:53,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:45:53,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:45:53,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:45:53,609 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:45:53,610 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:45:53,610 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product25.cil.c [2019-10-03 02:45:53,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eabffbdf4/5d1052c82c134efd9ef37a05128a9195/FLAGd85c3ef48 [2019-10-03 02:45:54,363 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:45:54,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product25.cil.c [2019-10-03 02:45:54,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eabffbdf4/5d1052c82c134efd9ef37a05128a9195/FLAGd85c3ef48 [2019-10-03 02:45:54,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eabffbdf4/5d1052c82c134efd9ef37a05128a9195 [2019-10-03 02:45:54,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:45:54,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:45:54,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:45:54,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:45:54,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:45:54,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:45:54" (1/1) ... [2019-10-03 02:45:54,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cce3650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:54, skipping insertion in model container [2019-10-03 02:45:54,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:45:54" (1/1) ... [2019-10-03 02:45:54,601 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:45:54,697 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:45:55,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:45:55,435 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:45:55,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:45:55,636 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:45:55,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55 WrapperNode [2019-10-03 02:45:55,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:45:55,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:45:55,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:45:55,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:45:55,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (1/1) ... [2019-10-03 02:45:55,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (1/1) ... [2019-10-03 02:45:55,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (1/1) ... [2019-10-03 02:45:55,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (1/1) ... [2019-10-03 02:45:55,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (1/1) ... [2019-10-03 02:45:55,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (1/1) ... [2019-10-03 02:45:55,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (1/1) ... [2019-10-03 02:45:55,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:45:55,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:45:55,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:45:55,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:45:55,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (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:45:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:45:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:45:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:45:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:45:55,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:45:55,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:45:55,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:45:55,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:45:55,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:45:55,941 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:45:55,941 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:45:55,942 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:45:55,942 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:45:55,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:45:55,943 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:45:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:45:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:45:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:45:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:45:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:45:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:45:55,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:45:55,945 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:45:55,945 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:45:55,945 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:45:55,946 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:45:55,946 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:45:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:45:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:45:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:45:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:45:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:45:55,947 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:45:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:45:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:45:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:45:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:45:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:45:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:45:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:45:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:45:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:45:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:45:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:45:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:45:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:45:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:45:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:45:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:45:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:45:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:45:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:45:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:45:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:45:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:45:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:45:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:45:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:45:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:45:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:45:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:45:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:45:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:45:55,953 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:45:55,953 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:45:55,953 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:45:55,953 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:45:55,954 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:45:55,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-03 02:45:55,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-03 02:45:55,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:45:55,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:45:55,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:45:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:45:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:45:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:45:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:45:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:45:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:45:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:45:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:45:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:45:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:45:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:45:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:45:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:45:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:45:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:45:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:45:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:45:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:45:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:45:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:45:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:45:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:45:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:45:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:45:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:45:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:45:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:45:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:45:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:45:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:45:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:45:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:45:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:45:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:45:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:45:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:45:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:45:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:45:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:45:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:45:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:45:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:45:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:45:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:45:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:45:55,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:45:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:45:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:45:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:45:55,969 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:45:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:45:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:45:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:45:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:45:55,971 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:45:55,974 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:45:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:45:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:45:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:45:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:45:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:45:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:45:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:45:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:45:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:45:55,978 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:45:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:45:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:45:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:45:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:45:55,981 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:45:55,982 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-03 02:45:55,982 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-03 02:45:55,982 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:45:55,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:45:55,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:45:55,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:45:58,229 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:45:58,230 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:45:58,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:45:58 BoogieIcfgContainer [2019-10-03 02:45:58,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:45:58,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:45:58,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:45:58,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:45:58,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:45:54" (1/3) ... [2019-10-03 02:45:58,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f02323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:45:58, skipping insertion in model container [2019-10-03 02:45:58,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:45:55" (2/3) ... [2019-10-03 02:45:58,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f02323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:45:58, skipping insertion in model container [2019-10-03 02:45:58,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:45:58" (3/3) ... [2019-10-03 02:45:58,240 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product25.cil.c [2019-10-03 02:45:58,250 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:45:58,259 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:45:58,277 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:45:58,304 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:45:58,304 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:45:58,305 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:45:58,305 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:45:58,305 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:45:58,305 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:45:58,305 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:45:58,305 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:45:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2019-10-03 02:45:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 02:45:58,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:58,380 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:58,382 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:58,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:58,387 INFO L82 PathProgramCache]: Analyzing trace with hash 9789385, now seen corresponding path program 1 times [2019-10-03 02:45:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:58,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:45:59,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:59,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:45:59,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:59,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:45:59,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:45:59,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:45:59,109 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 7 states. [2019-10-03 02:45:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:59,434 INFO L93 Difference]: Finished difference Result 637 states and 1016 transitions. [2019-10-03 02:45:59,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:45:59,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-10-03 02:45:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:59,471 INFO L225 Difference]: With dead ends: 637 [2019-10-03 02:45:59,471 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:45:59,474 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:45:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:45:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-10-03 02:45:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-03 02:45:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 999 transitions. [2019-10-03 02:45:59,604 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 999 transitions. Word has length 115 [2019-10-03 02:45:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:59,605 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 999 transitions. [2019-10-03 02:45:59,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:45:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 999 transitions. [2019-10-03 02:45:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 02:45:59,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:59,613 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:59,613 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:59,614 INFO L82 PathProgramCache]: Analyzing trace with hash -803565182, now seen corresponding path program 1 times [2019-10-03 02:45:59,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:59,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:59,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:45:59,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:59,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:45:59,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:59,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:45:59,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:45:59,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:59,889 INFO L87 Difference]: Start difference. First operand 624 states and 999 transitions. Second operand 4 states. [2019-10-03 02:45:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:59,975 INFO L93 Difference]: Finished difference Result 622 states and 994 transitions. [2019-10-03 02:45:59,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:45:59,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-03 02:45:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:59,984 INFO L225 Difference]: With dead ends: 622 [2019-10-03 02:45:59,985 INFO L226 Difference]: Without dead ends: 606 [2019-10-03 02:45:59,986 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:45:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-03 02:46:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-03 02:46:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-03 02:46:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 966 transitions. [2019-10-03 02:46:00,042 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 966 transitions. Word has length 116 [2019-10-03 02:46:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:00,044 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 966 transitions. [2019-10-03 02:46:00,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 966 transitions. [2019-10-03 02:46:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 02:46:00,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:00,050 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:00,050 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash -433705100, now seen corresponding path program 1 times [2019-10-03 02:46:00,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:00,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:00,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:00,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:00,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:00,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:00,306 INFO L87 Difference]: Start difference. First operand 606 states and 966 transitions. Second operand 7 states. [2019-10-03 02:46:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:00,416 INFO L93 Difference]: Finished difference Result 609 states and 969 transitions. [2019-10-03 02:46:00,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:00,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-10-03 02:46:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:00,423 INFO L225 Difference]: With dead ends: 609 [2019-10-03 02:46:00,423 INFO L226 Difference]: Without dead ends: 600 [2019-10-03 02:46:00,424 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:46:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-03 02:46:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-03 02:46:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:46:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 953 transitions. [2019-10-03 02:46:00,455 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 953 transitions. Word has length 116 [2019-10-03 02:46:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:00,456 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 953 transitions. [2019-10-03 02:46:00,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 953 transitions. [2019-10-03 02:46:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 02:46:00,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:00,462 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:00,462 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1336159923, now seen corresponding path program 1 times [2019-10-03 02:46:00,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:00,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:00,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:00,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:00,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:00,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:00,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:00,713 INFO L87 Difference]: Start difference. First operand 600 states and 953 transitions. Second operand 7 states. [2019-10-03 02:46:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:00,798 INFO L93 Difference]: Finished difference Result 603 states and 956 transitions. [2019-10-03 02:46:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:00,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-03 02:46:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:00,807 INFO L225 Difference]: With dead ends: 603 [2019-10-03 02:46:00,807 INFO L226 Difference]: Without dead ends: 594 [2019-10-03 02:46:00,808 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:46:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-03 02:46:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-10-03 02:46:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-03 02:46:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 940 transitions. [2019-10-03 02:46:00,831 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 940 transitions. Word has length 117 [2019-10-03 02:46:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:00,832 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 940 transitions. [2019-10-03 02:46:00,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 940 transitions. [2019-10-03 02:46:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 02:46:00,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:00,836 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:00,837 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash 713483960, now seen corresponding path program 1 times [2019-10-03 02:46:00,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:00,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:00,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:01,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:01,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:01,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:01,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:01,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:01,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:01,006 INFO L87 Difference]: Start difference. First operand 594 states and 940 transitions. Second operand 7 states. [2019-10-03 02:46:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:01,094 INFO L93 Difference]: Finished difference Result 597 states and 943 transitions. [2019-10-03 02:46:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:01,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-03 02:46:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:01,107 INFO L225 Difference]: With dead ends: 597 [2019-10-03 02:46:01,107 INFO L226 Difference]: Without dead ends: 588 [2019-10-03 02:46:01,107 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:46:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-03 02:46:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-03 02:46:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-03 02:46:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 927 transitions. [2019-10-03 02:46:01,130 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 927 transitions. Word has length 118 [2019-10-03 02:46:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:01,131 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 927 transitions. [2019-10-03 02:46:01,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 927 transitions. [2019-10-03 02:46:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 02:46:01,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:01,135 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:01,136 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash -467103239, now seen corresponding path program 1 times [2019-10-03 02:46:01,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:01,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:01,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:01,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:01,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:01,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:01,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:01,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:01,282 INFO L87 Difference]: Start difference. First operand 588 states and 927 transitions. Second operand 7 states. [2019-10-03 02:46:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:01,360 INFO L93 Difference]: Finished difference Result 591 states and 930 transitions. [2019-10-03 02:46:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:01,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-03 02:46:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:01,366 INFO L225 Difference]: With dead ends: 591 [2019-10-03 02:46:01,366 INFO L226 Difference]: Without dead ends: 588 [2019-10-03 02:46:01,367 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:46:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-03 02:46:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-03 02:46:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-03 02:46:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 926 transitions. [2019-10-03 02:46:01,396 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 926 transitions. Word has length 118 [2019-10-03 02:46:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:01,397 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 926 transitions. [2019-10-03 02:46:01,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 926 transitions. [2019-10-03 02:46:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 02:46:01,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:01,403 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:01,404 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:01,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:01,404 INFO L82 PathProgramCache]: Analyzing trace with hash -211092783, now seen corresponding path program 1 times [2019-10-03 02:46:01,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:01,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:01,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:01,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:01,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:01,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:01,708 INFO L87 Difference]: Start difference. First operand 588 states and 926 transitions. Second operand 5 states. [2019-10-03 02:46:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:01,806 INFO L93 Difference]: Finished difference Result 590 states and 927 transitions. [2019-10-03 02:46:01,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:01,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-03 02:46:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:01,811 INFO L225 Difference]: With dead ends: 590 [2019-10-03 02:46:01,811 INFO L226 Difference]: Without dead ends: 588 [2019-10-03 02:46:01,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-03 02:46:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-03 02:46:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-03 02:46:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 925 transitions. [2019-10-03 02:46:01,834 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 925 transitions. Word has length 119 [2019-10-03 02:46:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:01,835 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 925 transitions. [2019-10-03 02:46:01,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 925 transitions. [2019-10-03 02:46:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 02:46:01,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:01,838 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,839 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:01,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:01,839 INFO L82 PathProgramCache]: Analyzing trace with hash 644803690, now seen corresponding path program 1 times [2019-10-03 02:46:01,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:01,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:01,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:01,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:01,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:01,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:01,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:01,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:02,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:02,000 INFO L87 Difference]: Start difference. First operand 588 states and 925 transitions. Second operand 5 states. [2019-10-03 02:46:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:02,067 INFO L93 Difference]: Finished difference Result 590 states and 926 transitions. [2019-10-03 02:46:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:02,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-03 02:46:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:02,074 INFO L225 Difference]: With dead ends: 590 [2019-10-03 02:46:02,075 INFO L226 Difference]: Without dead ends: 588 [2019-10-03 02:46:02,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-03 02:46:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-03 02:46:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-03 02:46:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 924 transitions. [2019-10-03 02:46:02,095 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 924 transitions. Word has length 120 [2019-10-03 02:46:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:02,095 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 924 transitions. [2019-10-03 02:46:02,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 924 transitions. [2019-10-03 02:46:02,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 02:46:02,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:02,099 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,099 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1883967756, now seen corresponding path program 1 times [2019-10-03 02:46:02,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:02,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:02,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:02,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:02,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:02,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:02,237 INFO L87 Difference]: Start difference. First operand 588 states and 924 transitions. Second operand 5 states. [2019-10-03 02:46:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:02,303 INFO L93 Difference]: Finished difference Result 590 states and 925 transitions. [2019-10-03 02:46:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:02,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-03 02:46:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:02,311 INFO L225 Difference]: With dead ends: 590 [2019-10-03 02:46:02,311 INFO L226 Difference]: Without dead ends: 588 [2019-10-03 02:46:02,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-03 02:46:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-03 02:46:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-03 02:46:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 923 transitions. [2019-10-03 02:46:02,342 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 923 transitions. Word has length 121 [2019-10-03 02:46:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:02,342 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 923 transitions. [2019-10-03 02:46:02,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:02,343 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 923 transitions. [2019-10-03 02:46:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 02:46:02,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:02,347 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,347 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2119525317, now seen corresponding path program 1 times [2019-10-03 02:46:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:02,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:02,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:02,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:02,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:02,529 INFO L87 Difference]: Start difference. First operand 588 states and 923 transitions. Second operand 5 states. [2019-10-03 02:46:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:02,658 INFO L93 Difference]: Finished difference Result 590 states and 924 transitions. [2019-10-03 02:46:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:02,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-10-03 02:46:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:02,666 INFO L225 Difference]: With dead ends: 590 [2019-10-03 02:46:02,666 INFO L226 Difference]: Without dead ends: 588 [2019-10-03 02:46:02,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-10-03 02:46:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-10-03 02:46:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-03 02:46:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 922 transitions. [2019-10-03 02:46:02,696 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 922 transitions. Word has length 122 [2019-10-03 02:46:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:02,697 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 922 transitions. [2019-10-03 02:46:02,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 922 transitions. [2019-10-03 02:46:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-03 02:46:02,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:02,702 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,702 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1308052295, now seen corresponding path program 1 times [2019-10-03 02:46:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:02,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:46:02,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:02,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:46:02,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:02,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:46:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:46:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:02,978 INFO L87 Difference]: Start difference. First operand 588 states and 922 transitions. Second operand 8 states. [2019-10-03 02:46:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:06,023 INFO L93 Difference]: Finished difference Result 1585 states and 2482 transitions. [2019-10-03 02:46:06,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:46:06,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-03 02:46:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:06,036 INFO L225 Difference]: With dead ends: 1585 [2019-10-03 02:46:06,037 INFO L226 Difference]: Without dead ends: 1585 [2019-10-03 02:46:06,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:46:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-10-03 02:46:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-10-03 02:46:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-10-03 02:46:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2469 transitions. [2019-10-03 02:46:06,096 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2469 transitions. Word has length 123 [2019-10-03 02:46:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:06,096 INFO L475 AbstractCegarLoop]: Abstraction has 1573 states and 2469 transitions. [2019-10-03 02:46:06,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:46:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2469 transitions. [2019-10-03 02:46:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:46:06,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:06,100 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:06,100 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1202656165, now seen corresponding path program 1 times [2019-10-03 02:46:06,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:06,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:06,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:06,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:06,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:46:06,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:46:06,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:46:06,294 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-10-03 02:46:06,296 INFO L207 CegarAbsIntRunner]: [55], [56], [62], [63], [140], [144], [147], [384], [385], [388], [390], [393], [714], [763], [765], [767], [843], [846], [943], [946], [951], [954], [1020], [1023], [1024], [1025], [1092], [1093], [1094], [1096], [1125], [1127], [1130], [1138], [1139], [1175], [1211], [1247], [1283], [1286], [1289], [1322], [1323], [1324], [1331], [1336], [1341], [1346], [1351], [1354], [1358], [1587], [1590], [1612], [1628], [1641], [1646], [1650], [1654], [1752], [1753], [1847], [1850], [1852], [1855], [1879], [1881], [1883], [1886], [1899], [1913], [1927], [1941], [1955], [2029], [2207], [2299], [2302], [2320], [2489], [2490], [2491], [2492], [2493], [2494], [2495], [2496], [2497], [2535], [2536], [2557], [2558], [2559], [2560], [2561], [2562], [2563], [2564], [2565], [2593], [2594], [2595], [2596], [2625], [2626], [2627], [2628], [2639], [2657], [2658], [2659], [2660], [2663], [2664], [2665], [2671], [2715], [2716], [2717], [2723], [2724], [2725], [2726], [2757], [2758], [2759] [2019-10-03 02:46:06,379 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:46:06,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:46:06,539 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:46:06,541 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 132 root evaluator evaluations with a maximum evaluation depth of 0. Performed 132 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 254 variables. [2019-10-03 02:46:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:06,548 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:46:06,642 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:46:06,643 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:46:06,652 INFO L420 sIntCurrentIteration]: We unified 127 AI predicates to 127 [2019-10-03 02:46:06,653 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:46:06,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:46:06,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:46:06,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:06,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:46:06,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:46:06,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:46:06,656 INFO L87 Difference]: Start difference. First operand 1573 states and 2469 transitions. Second operand 2 states. [2019-10-03 02:46:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:06,657 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:46:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:46:06,657 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 128 [2019-10-03 02:46:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:06,657 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:46:06,657 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:46:06,658 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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:46:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:46:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:46:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:46:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:46:06,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2019-10-03 02:46:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:06,659 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:46:06,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:46:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:46:06,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:46:06,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:46:06 BoogieIcfgContainer [2019-10-03 02:46:06,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:46:06,669 INFO L168 Benchmark]: Toolchain (without parser) took 12083.78 ms. Allocated memory was 138.4 MB in the beginning and 438.3 MB in the end (delta: 299.9 MB). Free memory was 82.9 MB in the beginning and 150.6 MB in the end (delta: -67.6 MB). Peak memory consumption was 232.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:06,671 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:46:06,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1051.81 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 82.7 MB in the beginning and 140.7 MB in the end (delta: -57.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:06,674 INFO L168 Benchmark]: Boogie Preprocessor took 211.66 ms. Allocated memory is still 199.2 MB. Free memory was 140.7 MB in the beginning and 131.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:06,680 INFO L168 Benchmark]: RCFGBuilder took 2383.17 ms. Allocated memory was 199.2 MB in the beginning and 271.6 MB in the end (delta: 72.4 MB). Free memory was 131.1 MB in the beginning and 156.3 MB in the end (delta: -25.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:06,681 INFO L168 Benchmark]: TraceAbstraction took 8432.72 ms. Allocated memory was 271.6 MB in the beginning and 438.3 MB in the end (delta: 166.7 MB). Free memory was 156.3 MB in the beginning and 150.6 MB in the end (delta: 5.7 MB). Peak memory consumption was 172.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:06,695 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1051.81 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 82.7 MB in the beginning and 140.7 MB in the end (delta: -57.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 211.66 ms. Allocated memory is still 199.2 MB. Free memory was 140.7 MB in the beginning and 131.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2383.17 ms. Allocated memory was 199.2 MB in the beginning and 271.6 MB in the end (delta: 72.4 MB). Free memory was 131.1 MB in the beginning and 156.3 MB in the end (delta: -25.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8432.72 ms. Allocated memory was 271.6 MB in the beginning and 438.3 MB in the end (delta: 166.7 MB). Free memory was 156.3 MB in the beginning and 150.6 MB in the end (delta: 5.7 MB). Peak memory consumption was 172.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1115]: 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 73 procedures, 902 locations, 1 error locations. SAFE Result, 8.3s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11075 SDtfs, 2122 SDslu, 41488 SDs, 0 SdLazy, 2884 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1573occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.1968503937007875 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1433 NumberOfCodeBlocks, 1433 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1421 ConstructedInterpolants, 0 QuantifiedInterpolants, 209542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 34/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...