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_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:45:53,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:45:53,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:45:53,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:45:53,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:45:53,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:45:53,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:45:53,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:45:53,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:45:53,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:45:53,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:45:53,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:45:53,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:45:53,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:45:53,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:45:53,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:45:53,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:45:53,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:45:53,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:45:53,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:45:53,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:45:53,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:45:53,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:45:53,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:45:53,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:45:53,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:45:53,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:45:53,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:45:53,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:45:53,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:45:53,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:45:53,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:45:53,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:45:53,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:45:53,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:45:53,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:45:53,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:45:53,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:45:53,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:45:53,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:45:53,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:45:53,559 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,573 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:45:53,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:45:53,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:45:53,574 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:45:53,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:45:53,575 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:45:53,575 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:45:53,575 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:45:53,576 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:45:53,576 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:45:53,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:45:53,577 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:45:53,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:45:53,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:45:53,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:45:53,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:45:53,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:45:53,578 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:45:53,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:45:53,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:45:53,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:45:53,579 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:45:53,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:45:53,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:45:53,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:45:53,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:45:53,580 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:45:53,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:45:53,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:45:53,580 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:45:53,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:45:53,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:45:53,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:45:53,626 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:45:53,627 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:45:53,627 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c [2019-10-03 02:45:53,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2fe68ca/c1360b118980461f8ae8469e958888a9/FLAGa3d77e0b6 [2019-10-03 02:45:54,286 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:45:54,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c [2019-10-03 02:45:54,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2fe68ca/c1360b118980461f8ae8469e958888a9/FLAGa3d77e0b6 [2019-10-03 02:45:54,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2fe68ca/c1360b118980461f8ae8469e958888a9 [2019-10-03 02:45:54,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:45:54,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:45:54,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:45:54,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:45:54,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:45:54,462 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,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aceb178 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,465 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,473 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:45:54,554 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:45:55,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:45:55,427 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:45:55,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:45:55,661 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:45:55,662 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,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:45:55,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:45:55,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:45:55,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:45:55,684 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,685 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,718 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,718 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,792 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,836 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,857 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,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:45:55,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:45:55,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:45:55,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:45:55,885 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,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:45:55,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:45:55,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:45:55,977 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:45:55,977 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:45:55,978 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:45:55,978 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:45:55,978 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:45:55,978 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:45:55,978 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:45:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:45:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:45:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:45:55,980 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:45:55,980 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:45:55,981 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:45:55,982 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:45:55,982 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:45:55,982 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:45:55,982 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:45:55,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:45:55,983 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:45:55,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:45:55,983 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:45:55,983 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:45:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:45:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:45:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:45:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:45:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:45:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:45:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:45:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:45:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:45:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:45:55,985 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:45:55,986 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:45:55,986 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:45:55,986 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:45:55,986 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:45:55,986 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:45:55,986 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:45:55,986 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:45:55,987 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:45:55,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:45:55,987 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:45:55,987 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-03 02:45:55,987 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:45:55,987 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-03 02:45:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:45:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:45:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:45:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:45:55,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:45:55,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:45:55,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:45:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:45:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:45:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:45:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:45:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:45:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:45:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:45:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:45:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:45:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:45:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:45:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:45:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:45:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:45:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:45:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:45:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:45:55,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-03 02:45:55,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-03 02:45:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:45:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:45:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:45:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:45:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:45:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:45:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:45:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:45:55,996 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:45:55,996 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:45:55,996 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:45:55,996 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:45:55,996 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:45:55,996 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:45:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:45:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:45:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:45:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:45:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:45:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:45:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:45:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:45:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:45:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:45:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:45:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:45:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:45:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:45:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:45:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:45:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:45:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:45:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:45:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:45:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:45:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:45:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:45:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:45:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:45:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:45:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:45:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:45:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:45:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:45:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:45:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:45:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:45:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:45:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:45:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:45:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:45:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:45:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:45:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:45:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:45:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:45:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:45:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:45:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:45:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:45:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:45:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:45:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-03 02:45:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-03 02:45:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-03 02:45:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-03 02:45:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:45:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:45:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:45:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:45:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:45:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:45:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:45:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:45:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:45:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:45:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:45:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:45:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:45:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:45:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:45:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:45:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:45:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:45:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:45:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:45:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:45:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:45:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:45:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:45:58,305 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:45:58,305 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:45:58,308 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,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:45:58,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:45:58,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:45:58,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:45:58,314 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,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a53ad4f 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,315 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,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a53ad4f 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,315 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,317 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product26.cil.c [2019-10-03 02:45:58,328 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:45:58,338 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:45:58,355 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:45:58,383 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:45:58,383 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:45:58,384 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:45:58,384 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:45:58,384 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:45:58,384 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:45:58,384 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:45:58,384 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:45:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states. [2019-10-03 02:45:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:45:58,438 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:58,439 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:58,442 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:58,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1751841435, now seen corresponding path program 1 times [2019-10-03 02:45:58,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:58,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:58,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:59,152 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,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:59,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:45:59,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:59,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:45:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:45:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:45:59,185 INFO L87 Difference]: Start difference. First operand 797 states. Second operand 7 states. [2019-10-03 02:45:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:59,520 INFO L93 Difference]: Finished difference Result 649 states and 1031 transitions. [2019-10-03 02:45:59,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:45:59,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-03 02:45:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:59,552 INFO L225 Difference]: With dead ends: 649 [2019-10-03 02:45:59,552 INFO L226 Difference]: Without dead ends: 638 [2019-10-03 02:45:59,554 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,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-03 02:45:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-03 02:45:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-03 02:45:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1014 transitions. [2019-10-03 02:45:59,675 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1014 transitions. Word has length 93 [2019-10-03 02:45:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:59,676 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1014 transitions. [2019-10-03 02:45:59,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:45:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1014 transitions. [2019-10-03 02:45:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:45:59,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:59,691 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:59,691 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash 449544218, now seen corresponding path program 1 times [2019-10-03 02:45:59,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:59,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:59,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:59,893 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,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:59,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:45:59,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:59,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:45:59,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:45:59,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:59,902 INFO L87 Difference]: Start difference. First operand 636 states and 1014 transitions. Second operand 4 states. [2019-10-03 02:45:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:59,980 INFO L93 Difference]: Finished difference Result 634 states and 1009 transitions. [2019-10-03 02:45:59,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:45:59,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-03 02:45:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:59,988 INFO L225 Difference]: With dead ends: 634 [2019-10-03 02:45:59,989 INFO L226 Difference]: Without dead ends: 618 [2019-10-03 02:45:59,990 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,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-03 02:46:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-03 02:46:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-03 02:46:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 981 transitions. [2019-10-03 02:46:00,022 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 981 transitions. Word has length 94 [2019-10-03 02:46:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:00,023 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 981 transitions. [2019-10-03 02:46:00,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2019-10-03 02:46:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:46:00,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:00,027 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:00,027 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:00,028 INFO L82 PathProgramCache]: Analyzing trace with hash 451716357, now seen corresponding path program 1 times [2019-10-03 02:46:00,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:00,248 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,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:00,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:00,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:00,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:00,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:00,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:00,251 INFO L87 Difference]: Start difference. First operand 618 states and 981 transitions. Second operand 7 states. [2019-10-03 02:46:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:00,350 INFO L93 Difference]: Finished difference Result 621 states and 984 transitions. [2019-10-03 02:46:00,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:00,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-03 02:46:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:00,359 INFO L225 Difference]: With dead ends: 621 [2019-10-03 02:46:00,359 INFO L226 Difference]: Without dead ends: 612 [2019-10-03 02:46:00,360 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,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-03 02:46:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-03 02:46:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-03 02:46:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 968 transitions. [2019-10-03 02:46:00,398 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 968 transitions. Word has length 94 [2019-10-03 02:46:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:00,399 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 968 transitions. [2019-10-03 02:46:00,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 968 transitions. [2019-10-03 02:46:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:46:00,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:00,402 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:00,402 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:00,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2112280439, now seen corresponding path program 1 times [2019-10-03 02:46:00,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:00,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:00,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:00,622 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,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:00,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:00,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:00,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:00,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:00,625 INFO L87 Difference]: Start difference. First operand 612 states and 968 transitions. Second operand 7 states. [2019-10-03 02:46:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:00,711 INFO L93 Difference]: Finished difference Result 615 states and 971 transitions. [2019-10-03 02:46:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:00,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-03 02:46:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:00,718 INFO L225 Difference]: With dead ends: 615 [2019-10-03 02:46:00,718 INFO L226 Difference]: Without dead ends: 606 [2019-10-03 02:46:00,718 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,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-03 02:46:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-03 02:46:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-03 02:46:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 955 transitions. [2019-10-03 02:46:00,744 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 955 transitions. Word has length 95 [2019-10-03 02:46:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:00,744 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 955 transitions. [2019-10-03 02:46:00,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 955 transitions. [2019-10-03 02:46:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:46:00,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:00,747 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:00,747 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:00,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2146614103, now seen corresponding path program 1 times [2019-10-03 02:46:00,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:00,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:00,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:00,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:00,908 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,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:00,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:00,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:00,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:00,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:00,911 INFO L87 Difference]: Start difference. First operand 606 states and 955 transitions. Second operand 7 states. [2019-10-03 02:46:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:00,989 INFO L93 Difference]: Finished difference Result 609 states and 958 transitions. [2019-10-03 02:46:00,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:00,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-03 02:46:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:00,995 INFO L225 Difference]: With dead ends: 609 [2019-10-03 02:46:00,996 INFO L226 Difference]: Without dead ends: 600 [2019-10-03 02:46:00,996 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,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-03 02:46:01,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-03 02:46:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:46:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 942 transitions. [2019-10-03 02:46:01,017 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 942 transitions. Word has length 96 [2019-10-03 02:46:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:01,018 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 942 transitions. [2019-10-03 02:46:01,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 942 transitions. [2019-10-03 02:46:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:46:01,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:01,020 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:01,020 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:01,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:01,021 INFO L82 PathProgramCache]: Analyzing trace with hash -757672278, now seen corresponding path program 1 times [2019-10-03 02:46:01,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:01,171 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,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:01,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:01,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:01,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:01,173 INFO L87 Difference]: Start difference. First operand 600 states and 942 transitions. Second operand 7 states. [2019-10-03 02:46:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:01,245 INFO L93 Difference]: Finished difference Result 603 states and 945 transitions. [2019-10-03 02:46:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:01,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-03 02:46:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:01,261 INFO L225 Difference]: With dead ends: 603 [2019-10-03 02:46:01,261 INFO L226 Difference]: Without dead ends: 600 [2019-10-03 02:46:01,262 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,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-03 02:46:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-03 02:46:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:46:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 941 transitions. [2019-10-03 02:46:01,284 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 941 transitions. Word has length 96 [2019-10-03 02:46:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:01,284 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 941 transitions. [2019-10-03 02:46:01,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 941 transitions. [2019-10-03 02:46:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:46:01,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:01,289 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:01,289 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1070802003, now seen corresponding path program 1 times [2019-10-03 02:46:01,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:01,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:01,439 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,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:01,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:01,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:01,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:01,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:01,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:01,441 INFO L87 Difference]: Start difference. First operand 600 states and 941 transitions. Second operand 5 states. [2019-10-03 02:46:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:01,549 INFO L93 Difference]: Finished difference Result 602 states and 942 transitions. [2019-10-03 02:46:01,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:01,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-03 02:46:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:01,555 INFO L225 Difference]: With dead ends: 602 [2019-10-03 02:46:01,555 INFO L226 Difference]: Without dead ends: 600 [2019-10-03 02:46:01,556 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,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-03 02:46:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-03 02:46:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:46:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 940 transitions. [2019-10-03 02:46:01,580 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 940 transitions. Word has length 97 [2019-10-03 02:46:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:01,580 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 940 transitions. [2019-10-03 02:46:01,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 940 transitions. [2019-10-03 02:46:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:46:01,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:01,583 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:01,583 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash -647387713, now seen corresponding path program 1 times [2019-10-03 02:46:01,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:01,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:01,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:01,727 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,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:01,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:01,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:01,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:01,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:01,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:01,731 INFO L87 Difference]: Start difference. First operand 600 states and 940 transitions. Second operand 5 states. [2019-10-03 02:46:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:01,814 INFO L93 Difference]: Finished difference Result 602 states and 941 transitions. [2019-10-03 02:46:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:01,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-03 02:46:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:01,823 INFO L225 Difference]: With dead ends: 602 [2019-10-03 02:46:01,824 INFO L226 Difference]: Without dead ends: 600 [2019-10-03 02:46:01,824 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,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-03 02:46:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-03 02:46:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:46:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 939 transitions. [2019-10-03 02:46:01,854 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 939 transitions. Word has length 98 [2019-10-03 02:46:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:01,856 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 939 transitions. [2019-10-03 02:46:01,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 939 transitions. [2019-10-03 02:46:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:46:01,860 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:01,860 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:01,861 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:01,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:01,862 INFO L82 PathProgramCache]: Analyzing trace with hash 146491208, now seen corresponding path program 1 times [2019-10-03 02:46:01,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:01,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:01,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:01,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:02,019 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,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:02,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:02,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:02,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:02,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:02,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:02,022 INFO L87 Difference]: Start difference. First operand 600 states and 939 transitions. Second operand 5 states. [2019-10-03 02:46:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:02,093 INFO L93 Difference]: Finished difference Result 602 states and 940 transitions. [2019-10-03 02:46:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:02,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-03 02:46:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:02,101 INFO L225 Difference]: With dead ends: 602 [2019-10-03 02:46:02,101 INFO L226 Difference]: Without dead ends: 600 [2019-10-03 02:46:02,102 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,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-03 02:46:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-03 02:46:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:46:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 938 transitions. [2019-10-03 02:46:02,127 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 938 transitions. Word has length 99 [2019-10-03 02:46:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:02,128 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 938 transitions. [2019-10-03 02:46:02,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 938 transitions. [2019-10-03 02:46:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 02:46:02,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:02,130 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] [2019-10-03 02:46:02,130 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:02,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:02,131 INFO L82 PathProgramCache]: Analyzing trace with hash -460128198, now seen corresponding path program 1 times [2019-10-03 02:46:02,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:02,299 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,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:02,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:02,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:02,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:02,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:02,302 INFO L87 Difference]: Start difference. First operand 600 states and 938 transitions. Second operand 5 states. [2019-10-03 02:46:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:02,369 INFO L93 Difference]: Finished difference Result 602 states and 939 transitions. [2019-10-03 02:46:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:02,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-03 02:46:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:02,377 INFO L225 Difference]: With dead ends: 602 [2019-10-03 02:46:02,377 INFO L226 Difference]: Without dead ends: 600 [2019-10-03 02:46:02,378 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,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-03 02:46:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-03 02:46:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:46:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 937 transitions. [2019-10-03 02:46:02,402 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 937 transitions. Word has length 100 [2019-10-03 02:46:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:02,403 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 937 transitions. [2019-10-03 02:46:02,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 937 transitions. [2019-10-03 02:46:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:46:02,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:02,405 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] [2019-10-03 02:46:02,405 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:02,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:02,406 INFO L82 PathProgramCache]: Analyzing trace with hash 406639265, now seen corresponding path program 1 times [2019-10-03 02:46:02,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:02,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:02,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:02,662 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,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:02,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:46:02,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:02,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:46:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:46:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:46:02,664 INFO L87 Difference]: Start difference. First operand 600 states and 937 transitions. Second operand 9 states. [2019-10-03 02:46:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:02,825 INFO L93 Difference]: Finished difference Result 604 states and 940 transitions. [2019-10-03 02:46:02,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:46:02,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-03 02:46:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:02,834 INFO L225 Difference]: With dead ends: 604 [2019-10-03 02:46:02,834 INFO L226 Difference]: Without dead ends: 600 [2019-10-03 02:46:02,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:46:02,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-03 02:46:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-03 02:46:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-03 02:46:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 936 transitions. [2019-10-03 02:46:02,865 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 936 transitions. Word has length 101 [2019-10-03 02:46:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:02,867 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 936 transitions. [2019-10-03 02:46:02,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:46:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 936 transitions. [2019-10-03 02:46:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:46:02,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:02,870 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] [2019-10-03 02:46:02,870 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1532522781, now seen corresponding path program 1 times [2019-10-03 02:46:02,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:02,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:02,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:03,166 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:03,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:03,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:46:03,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:03,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:46:03,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:46:03,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:03,170 INFO L87 Difference]: Start difference. First operand 600 states and 936 transitions. Second operand 8 states. [2019-10-03 02:46:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:06,585 INFO L93 Difference]: Finished difference Result 1621 states and 2528 transitions. [2019-10-03 02:46:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:46:06,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-03 02:46:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:06,600 INFO L225 Difference]: With dead ends: 1621 [2019-10-03 02:46:06,600 INFO L226 Difference]: Without dead ends: 1621 [2019-10-03 02:46:06,601 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,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2019-10-03 02:46:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1609. [2019-10-03 02:46:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-10-03 02:46:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2515 transitions. [2019-10-03 02:46:06,664 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2515 transitions. Word has length 101 [2019-10-03 02:46:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:06,665 INFO L475 AbstractCegarLoop]: Abstraction has 1609 states and 2515 transitions. [2019-10-03 02:46:06,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:46:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2515 transitions. [2019-10-03 02:46:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:46:06,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:06,666 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] [2019-10-03 02:46:06,666 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:06,667 INFO L82 PathProgramCache]: Analyzing trace with hash -756173853, now seen corresponding path program 1 times [2019-10-03 02:46:06,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:06,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:06,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:06,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:06,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:06,856 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,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:46:06,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:46:06,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-10-03 02:46:06,860 INFO L207 CegarAbsIntRunner]: [60], [61], [62], [63], [140], [144], [147], [472], [851], [853], [855], [971], [974], [977], [980], [995], [996], [997], [1002], [1069], [1070], [1071], [1073], [1116], [1152], [1188], [1224], [1260], [1263], [1266], [1299], [1300], [1301], [1352], [1357], [1362], [1367], [1372], [1375], [1379], [1693], [1696], [1718], [1858], [1859], [1951], [1954], [1956], [1959], [1985], [1987], [1989], [1992], [2005], [2019], [2033], [2047], [2061], [2135], [2324], [2518], [2519], [2520], [2521], [2522], [2523], [2524], [2525], [2526], [2596], [2597], [2598], [2599], [2600], [2601], [2602], [2603], [2604], [2640], [2641], [2642], [2643], [2648], [2658], [2659], [2664], [2665], [2666], [2692], [2760], [2761], [2762], [2768], [2769], [2770], [2771], [2796], [2797], [2798] [2019-10-03 02:46:06,918 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:46:06,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:46:07,041 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:46:07,043 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 151 root evaluator evaluations with a maximum evaluation depth of 0. Performed 151 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 260 variables. [2019-10-03 02:46:07,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:07,050 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:46:07,129 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:46:07,129 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:46:07,137 INFO L420 sIntCurrentIteration]: We unified 100 AI predicates to 100 [2019-10-03 02:46:07,137 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:46:07,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:46:07,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:46:07,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:07,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:46:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:46:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:46:07,140 INFO L87 Difference]: Start difference. First operand 1609 states and 2515 transitions. Second operand 2 states. [2019-10-03 02:46:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:07,141 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:46:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:46:07,141 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 101 [2019-10-03 02:46:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:07,142 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:46:07,142 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:46:07,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:46:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:46:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:46:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:46:07,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-10-03 02:46:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:07,144 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:46:07,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:46:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:46:07,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:46:07,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:46:07 BoogieIcfgContainer [2019-10-03 02:46:07,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:46:07,153 INFO L168 Benchmark]: Toolchain (without parser) took 12698.12 ms. Allocated memory was 138.9 MB in the beginning and 411.6 MB in the end (delta: 272.6 MB). Free memory was 83.8 MB in the beginning and 63.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 292.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:07,155 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.7 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:07,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1206.96 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 83.6 MB in the beginning and 137.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:07,165 INFO L168 Benchmark]: Boogie Preprocessor took 218.37 ms. Allocated memory is still 200.8 MB. Free memory was 137.9 MB in the beginning and 128.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:07,167 INFO L168 Benchmark]: RCFGBuilder took 2427.06 ms. Allocated memory was 200.8 MB in the beginning and 270.5 MB in the end (delta: 69.7 MB). Free memory was 128.3 MB in the beginning and 151.1 MB in the end (delta: -22.8 MB). Peak memory consumption was 91.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:07,195 INFO L168 Benchmark]: TraceAbstraction took 8840.14 ms. Allocated memory was 270.5 MB in the beginning and 411.6 MB in the end (delta: 141.0 MB). Free memory was 151.1 MB in the beginning and 63.8 MB in the end (delta: 87.3 MB). Peak memory consumption was 228.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:07,200 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.26 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1206.96 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 83.6 MB in the beginning and 137.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 218.37 ms. Allocated memory is still 200.8 MB. Free memory was 137.9 MB in the beginning and 128.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2427.06 ms. Allocated memory was 200.8 MB in the beginning and 270.5 MB in the end (delta: 69.7 MB). Free memory was 128.3 MB in the beginning and 151.1 MB in the end (delta: -22.8 MB). Peak memory consumption was 91.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8840.14 ms. Allocated memory was 270.5 MB in the beginning and 411.6 MB in the end (delta: 141.0 MB). Free memory was 151.1 MB in the beginning and 63.8 MB in the end (delta: 87.3 MB). Peak memory consumption was 228.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3181]: 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 75 procedures, 918 locations, 1 error locations. SAFE Result, 8.7s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12126 SDtfs, 2172 SDslu, 48351 SDs, 0 SdLazy, 3038 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1609occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.31 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1265 NumberOfCodeBlocks, 1265 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1252 ConstructedInterpolants, 0 QuantifiedInterpolants, 158400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 37/39 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...