java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:30:08,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:30:08,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:30:08,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:30:08,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:30:08,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:30:08,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:30:08,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:30:08,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:30:08,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:30:08,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:30:08,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:30:08,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:30:08,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:30:08,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:30:08,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:30:08,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:30:08,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:30:08,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:30:08,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:30:08,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:30:08,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:30:08,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:30:08,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:30:08,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:30:08,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:30:08,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:30:08,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:30:08,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:30:08,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:30:08,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:30:08,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:30:08,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:30:08,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:30:08,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:30:08,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:30:08,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:30:08,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:30:08,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:30:08,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:30:08,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:30:08,569 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-09-10 02:30:08,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:30:08,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:30:08,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:30:08,585 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:30:08,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:30:08,585 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:30:08,586 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:30:08,586 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:30:08,586 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:30:08,586 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:30:08,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:30:08,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:30:08,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:30:08,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:30:08,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:30:08,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:30:08,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:30:08,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:30:08,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:30:08,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:30:08,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:30:08,589 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:30:08,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:30:08,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:30:08,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:30:08,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:30:08,590 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:30:08,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:30:08,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:30:08,591 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:30:08,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:30:08,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:30:08,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:30:08,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:30:08,638 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:30:08,639 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product20.cil.c [2019-09-10 02:30:08,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cbbf6b5/027440a6a8d34e7b802db1ab9045e792/FLAG64caf1ffa [2019-09-10 02:30:09,395 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:30:09,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product20.cil.c [2019-09-10 02:30:09,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cbbf6b5/027440a6a8d34e7b802db1ab9045e792/FLAG64caf1ffa [2019-09-10 02:30:09,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cbbf6b5/027440a6a8d34e7b802db1ab9045e792 [2019-09-10 02:30:09,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:30:09,549 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:30:09,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:30:09,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:30:09,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:30:09,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:30:09" (1/1) ... [2019-09-10 02:30:09,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c13f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:09, skipping insertion in model container [2019-09-10 02:30:09,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:30:09" (1/1) ... [2019-09-10 02:30:09,567 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:30:09,655 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:30:10,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:30:10,372 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:30:10,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:30:10,618 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:30:10,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10 WrapperNode [2019-09-10 02:30:10,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:30:10,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:30:10,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:30:10,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:30:10,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (1/1) ... [2019-09-10 02:30:10,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (1/1) ... [2019-09-10 02:30:10,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (1/1) ... [2019-09-10 02:30:10,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (1/1) ... [2019-09-10 02:30:10,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (1/1) ... [2019-09-10 02:30:10,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (1/1) ... [2019-09-10 02:30:10,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (1/1) ... [2019-09-10 02:30:10,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:30:10,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:30:10,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:30:10,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:30:10,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (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-09-10 02:30:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:30:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:30:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:30:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:30:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:30:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:30:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:30:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:30:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:30:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:30:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:30:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-10 02:30:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:30:10,899 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:30:10,899 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:30:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:30:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:30:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:30:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:30:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:30:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:30:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:30:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:30:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:30:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:30:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:30:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:30:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:30:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:30:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:30:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:30:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:30:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:30:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:30:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:30:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:30:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:30:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:30:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:30:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:30:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:30:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:30:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:30:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:30:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:30:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:30:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:30:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:30:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:30:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:30:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:30:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:30:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:30:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:30:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:30:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:30:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:30:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:30:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:30:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:30:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:30:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:30:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:30:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:30:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:30:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:30:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-10 02:30:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:30:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-10 02:30:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:30:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:30:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:30:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:30:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:30:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:30:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:30:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:30:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:30:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:30:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:30:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:30:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:30:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:30:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:30:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:30:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:30:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:30:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:30:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:30:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:30:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:30:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:30:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:30:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:30:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:30:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:30:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:30:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:30:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:30:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:30:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:30:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:30:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:30:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:30:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:30:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:30:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:30:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:30:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:30:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:30:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-10 02:30:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:30:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:30:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:30:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:30:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:30:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:30:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:30:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:30:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:30:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:30:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:30:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:30:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:30:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:30:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:30:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:30:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:30:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:30:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:30:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:30:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:30:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:30:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:30:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:30:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:30:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:30:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:30:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:30:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:30:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:30:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:30:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:30:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:30:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:30:10,937 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:30:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:30:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:30:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:30:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:30:10,938 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:30:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:30:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:30:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:30:10,939 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:30:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:30:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:30:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:30:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:30:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:30:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:30:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:30:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:30:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-10 02:30:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-10 02:30:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:30:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:30:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:30:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:30:13,409 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:30:13,410 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:30:13,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:30:13 BoogieIcfgContainer [2019-09-10 02:30:13,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:30:13,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:30:13,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:30:13,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:30:13,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:30:09" (1/3) ... [2019-09-10 02:30:13,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5befe6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:30:13, skipping insertion in model container [2019-09-10 02:30:13,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:10" (2/3) ... [2019-09-10 02:30:13,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5befe6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:30:13, skipping insertion in model container [2019-09-10 02:30:13,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:30:13" (3/3) ... [2019-09-10 02:30:13,420 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product20.cil.c [2019-09-10 02:30:13,430 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:30:13,440 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:30:13,456 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:30:13,491 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:30:13,492 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:30:13,492 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:30:13,492 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:30:13,492 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:30:13,492 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:30:13,492 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:30:13,493 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:30:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states. [2019-09-10 02:30:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 02:30:13,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:13,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:13,561 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:13,565 INFO L82 PathProgramCache]: Analyzing trace with hash -570931917, now seen corresponding path program 1 times [2019-09-10 02:30:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:13,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:13,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:13,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:13,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:14,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:14,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:14,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:14,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:14,113 INFO L87 Difference]: Start difference. First operand 751 states. Second operand 4 states. [2019-09-10 02:30:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:14,399 INFO L93 Difference]: Finished difference Result 607 states and 955 transitions. [2019-09-10 02:30:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:30:14,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-10 02:30:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:14,426 INFO L225 Difference]: With dead ends: 607 [2019-09-10 02:30:14,426 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 02:30:14,428 INFO L628 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-09-10 02:30:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 02:30:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-09-10 02:30:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-10 02:30:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 941 transitions. [2019-09-10 02:30:14,569 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 941 transitions. Word has length 87 [2019-09-10 02:30:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:14,570 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 941 transitions. [2019-09-10 02:30:14,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 941 transitions. [2019-09-10 02:30:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:30:14,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:14,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:14,576 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:14,576 INFO L82 PathProgramCache]: Analyzing trace with hash 801065692, now seen corresponding path program 1 times [2019-09-10 02:30:14,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:14,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:14,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:14,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:14,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:14,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:14,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:14,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:14,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:14,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:14,794 INFO L87 Difference]: Start difference. First operand 596 states and 941 transitions. Second operand 4 states. [2019-09-10 02:30:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:14,882 INFO L93 Difference]: Finished difference Result 598 states and 942 transitions. [2019-09-10 02:30:14,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:14,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 02:30:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:14,889 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:30:14,889 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 02:30:14,890 INFO L628 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-09-10 02:30:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 02:30:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-09-10 02:30:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-10 02:30:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 940 transitions. [2019-09-10 02:30:14,916 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 940 transitions. Word has length 88 [2019-09-10 02:30:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:14,917 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 940 transitions. [2019-09-10 02:30:14,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 940 transitions. [2019-09-10 02:30:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 02:30:14,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:14,921 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:14,921 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:14,921 INFO L82 PathProgramCache]: Analyzing trace with hash 786966479, now seen corresponding path program 1 times [2019-09-10 02:30:14,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:14,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:14,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:14,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:14,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:15,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:15,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:15,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:15,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:15,093 INFO L87 Difference]: Start difference. First operand 596 states and 940 transitions. Second operand 4 states. [2019-09-10 02:30:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:15,165 INFO L93 Difference]: Finished difference Result 598 states and 941 transitions. [2019-09-10 02:30:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:15,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 02:30:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:15,171 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:30:15,172 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 02:30:15,172 INFO L628 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-09-10 02:30:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 02:30:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-09-10 02:30:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-10 02:30:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 939 transitions. [2019-09-10 02:30:15,213 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 939 transitions. Word has length 89 [2019-09-10 02:30:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:15,213 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 939 transitions. [2019-09-10 02:30:15,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 939 transitions. [2019-09-10 02:30:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:30:15,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:15,215 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:15,215 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:15,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 753538744, now seen corresponding path program 1 times [2019-09-10 02:30:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:15,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:15,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:15,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:15,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:15,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:15,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:15,431 INFO L87 Difference]: Start difference. First operand 596 states and 939 transitions. Second operand 4 states. [2019-09-10 02:30:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:15,495 INFO L93 Difference]: Finished difference Result 598 states and 940 transitions. [2019-09-10 02:30:15,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:15,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:30:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:15,501 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:30:15,501 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 02:30:15,502 INFO L628 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-09-10 02:30:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 02:30:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-09-10 02:30:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-10 02:30:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 938 transitions. [2019-09-10 02:30:15,525 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 938 transitions. Word has length 90 [2019-09-10 02:30:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:15,526 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 938 transitions. [2019-09-10 02:30:15,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 938 transitions. [2019-09-10 02:30:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:30:15,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:15,532 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:15,534 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash 120926827, now seen corresponding path program 1 times [2019-09-10 02:30:15,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:15,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:15,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:15,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:15,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:15,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:15,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:15,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:15,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:15,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:15,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:15,648 INFO L87 Difference]: Start difference. First operand 596 states and 938 transitions. Second operand 4 states. [2019-09-10 02:30:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:15,703 INFO L93 Difference]: Finished difference Result 598 states and 939 transitions. [2019-09-10 02:30:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:15,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:30:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:15,710 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:30:15,710 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 02:30:15,711 INFO L628 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-09-10 02:30:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 02:30:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-09-10 02:30:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-10 02:30:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 937 transitions. [2019-09-10 02:30:15,733 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 937 transitions. Word has length 91 [2019-09-10 02:30:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:15,734 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 937 transitions. [2019-09-10 02:30:15,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 937 transitions. [2019-09-10 02:30:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:30:15,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:15,741 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:15,741 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1906525548, now seen corresponding path program 1 times [2019-09-10 02:30:15,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:15,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:15,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:15,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:15,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:15,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:30:15,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:15,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:30:15,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:30:15,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:30:15,963 INFO L87 Difference]: Start difference. First operand 596 states and 937 transitions. Second operand 10 states. [2019-09-10 02:30:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:16,154 INFO L93 Difference]: Finished difference Result 605 states and 949 transitions. [2019-09-10 02:30:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:30:16,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-10 02:30:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:16,159 INFO L225 Difference]: With dead ends: 605 [2019-09-10 02:30:16,159 INFO L226 Difference]: Without dead ends: 605 [2019-09-10 02:30:16,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:30:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-10 02:30:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-09-10 02:30:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-10 02:30:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 947 transitions. [2019-09-10 02:30:16,183 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 947 transitions. Word has length 92 [2019-09-10 02:30:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:16,185 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 947 transitions. [2019-09-10 02:30:16,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:30:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 947 transitions. [2019-09-10 02:30:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:30:16,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:16,187 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:16,188 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:16,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1805613581, now seen corresponding path program 1 times [2019-09-10 02:30:16,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:16,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:16,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:16,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:16,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:16,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:16,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:16,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:16,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:16,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:16,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:16,291 INFO L87 Difference]: Start difference. First operand 603 states and 947 transitions. Second operand 4 states. [2019-09-10 02:30:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:16,390 INFO L93 Difference]: Finished difference Result 601 states and 942 transitions. [2019-09-10 02:30:16,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:30:16,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:30:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:16,395 INFO L225 Difference]: With dead ends: 601 [2019-09-10 02:30:16,395 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:30:16,396 INFO L628 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-09-10 02:30:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:30:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:30:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:30:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 940 transitions. [2019-09-10 02:30:16,414 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 940 transitions. Word has length 92 [2019-09-10 02:30:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:16,415 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 940 transitions. [2019-09-10 02:30:16,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 940 transitions. [2019-09-10 02:30:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:30:16,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:16,417 INFO L399 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-09-10 02:30:16,417 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:16,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:16,417 INFO L82 PathProgramCache]: Analyzing trace with hash -940394859, now seen corresponding path program 1 times [2019-09-10 02:30:16,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:16,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:16,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:16,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:16,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:16,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:16,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:16,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:16,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:16,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:16,528 INFO L87 Difference]: Start difference. First operand 599 states and 940 transitions. Second operand 6 states. [2019-09-10 02:30:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:16,800 INFO L93 Difference]: Finished difference Result 616 states and 961 transitions. [2019-09-10 02:30:16,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:30:16,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-10 02:30:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:16,806 INFO L225 Difference]: With dead ends: 616 [2019-09-10 02:30:16,806 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:30:16,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:30:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-09-10 02:30:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-10 02:30:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 941 transitions. [2019-09-10 02:30:16,828 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 941 transitions. Word has length 93 [2019-09-10 02:30:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:16,828 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 941 transitions. [2019-09-10 02:30:16,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 941 transitions. [2019-09-10 02:30:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:30:16,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:16,830 INFO L399 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-09-10 02:30:16,830 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash 101605271, now seen corresponding path program 1 times [2019-09-10 02:30:16,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:16,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:16,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:16,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:16,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:16,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:16,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:16,949 INFO L87 Difference]: Start difference. First operand 604 states and 941 transitions. Second operand 6 states. [2019-09-10 02:30:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:17,184 INFO L93 Difference]: Finished difference Result 607 states and 944 transitions. [2019-09-10 02:30:17,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:17,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-10 02:30:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:17,191 INFO L225 Difference]: With dead ends: 607 [2019-09-10 02:30:17,191 INFO L226 Difference]: Without dead ends: 604 [2019-09-10 02:30:17,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-10 02:30:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-09-10 02:30:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-10 02:30:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 937 transitions. [2019-09-10 02:30:17,212 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 937 transitions. Word has length 94 [2019-09-10 02:30:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:17,212 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 937 transitions. [2019-09-10 02:30:17,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 937 transitions. [2019-09-10 02:30:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:30:17,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:17,215 INFO L399 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-09-10 02:30:17,215 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:17,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1301106266, now seen corresponding path program 1 times [2019-09-10 02:30:17,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:17,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:17,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:17,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:17,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:17,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:17,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:17,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:17,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:17,375 INFO L87 Difference]: Start difference. First operand 604 states and 937 transitions. Second operand 6 states. [2019-09-10 02:30:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:17,589 INFO L93 Difference]: Finished difference Result 607 states and 940 transitions. [2019-09-10 02:30:17,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:17,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:30:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:17,594 INFO L225 Difference]: With dead ends: 607 [2019-09-10 02:30:17,594 INFO L226 Difference]: Without dead ends: 604 [2019-09-10 02:30:17,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-10 02:30:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-09-10 02:30:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-10 02:30:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 933 transitions. [2019-09-10 02:30:17,612 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 933 transitions. Word has length 95 [2019-09-10 02:30:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:17,613 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 933 transitions. [2019-09-10 02:30:17,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 933 transitions. [2019-09-10 02:30:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:30:17,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:17,615 INFO L399 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-09-10 02:30:17,615 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:17,615 INFO L82 PathProgramCache]: Analyzing trace with hash 405801690, now seen corresponding path program 1 times [2019-09-10 02:30:17,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:17,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:17,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:17,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:17,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:17,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:30:17,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:17,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:30:17,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:30:17,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:30:17,726 INFO L87 Difference]: Start difference. First operand 604 states and 933 transitions. Second operand 7 states. [2019-09-10 02:30:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:17,827 INFO L93 Difference]: Finished difference Result 610 states and 940 transitions. [2019-09-10 02:30:17,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:30:17,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 02:30:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:17,832 INFO L225 Difference]: With dead ends: 610 [2019-09-10 02:30:17,832 INFO L226 Difference]: Without dead ends: 586 [2019-09-10 02:30:17,833 INFO L628 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-09-10 02:30:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-10 02:30:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2019-09-10 02:30:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:30:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 896 transitions. [2019-09-10 02:30:17,851 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 896 transitions. Word has length 95 [2019-09-10 02:30:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:17,851 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 896 transitions. [2019-09-10 02:30:17,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:30:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 896 transitions. [2019-09-10 02:30:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:30:17,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:17,853 INFO L399 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-09-10 02:30:17,853 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1206800516, now seen corresponding path program 1 times [2019-09-10 02:30:17,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:17,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:17,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:17,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:17,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:17,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:17,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:17,957 INFO L87 Difference]: Start difference. First operand 583 states and 896 transitions. Second operand 6 states. [2019-09-10 02:30:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:18,083 INFO L93 Difference]: Finished difference Result 586 states and 899 transitions. [2019-09-10 02:30:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:18,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:30:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:18,088 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:30:18,088 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:30:18,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:30:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:30:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:30:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 895 transitions. [2019-09-10 02:30:18,106 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 895 transitions. Word has length 96 [2019-09-10 02:30:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:18,107 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 895 transitions. [2019-09-10 02:30:18,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 895 transitions. [2019-09-10 02:30:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:30:18,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:18,109 INFO L399 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-09-10 02:30:18,109 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1614735903, now seen corresponding path program 1 times [2019-09-10 02:30:18,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:18,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:18,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:18,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:18,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:18,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:18,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:18,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:18,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:18,205 INFO L87 Difference]: Start difference. First operand 583 states and 895 transitions. Second operand 6 states. [2019-09-10 02:30:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:18,351 INFO L93 Difference]: Finished difference Result 586 states and 898 transitions. [2019-09-10 02:30:18,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:18,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:30:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:18,358 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:30:18,358 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:30:18,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:30:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:30:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:30:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 894 transitions. [2019-09-10 02:30:18,430 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 894 transitions. Word has length 97 [2019-09-10 02:30:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:18,431 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 894 transitions. [2019-09-10 02:30:18,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 894 transitions. [2019-09-10 02:30:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:30:18,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:18,433 INFO L399 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-09-10 02:30:18,433 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:18,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:18,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2145287009, now seen corresponding path program 1 times [2019-09-10 02:30:18,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:18,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:18,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:18,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:18,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:18,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:30:18,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:18,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:30:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:30:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:30:18,642 INFO L87 Difference]: Start difference. First operand 583 states and 894 transitions. Second operand 12 states. [2019-09-10 02:30:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:18,906 INFO L93 Difference]: Finished difference Result 592 states and 904 transitions. [2019-09-10 02:30:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:30:18,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 02:30:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:18,910 INFO L225 Difference]: With dead ends: 592 [2019-09-10 02:30:18,910 INFO L226 Difference]: Without dead ends: 590 [2019-09-10 02:30:18,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:30:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-10 02:30:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-09-10 02:30:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-09-10 02:30:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 900 transitions. [2019-09-10 02:30:18,932 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 900 transitions. Word has length 98 [2019-09-10 02:30:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:18,934 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 900 transitions. [2019-09-10 02:30:18,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:30:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 900 transitions. [2019-09-10 02:30:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:30:18,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:18,936 INFO L399 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-09-10 02:30:18,936 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 657724894, now seen corresponding path program 1 times [2019-09-10 02:30:18,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:18,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:18,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:18,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:19,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:19,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:19,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:19,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:19,043 INFO L87 Difference]: Start difference. First operand 588 states and 900 transitions. Second operand 6 states. [2019-09-10 02:30:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:19,688 INFO L93 Difference]: Finished difference Result 592 states and 904 transitions. [2019-09-10 02:30:19,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:19,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 02:30:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:19,693 INFO L225 Difference]: With dead ends: 592 [2019-09-10 02:30:19,693 INFO L226 Difference]: Without dead ends: 592 [2019-09-10 02:30:19,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:30:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-10 02:30:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-09-10 02:30:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-10 02:30:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 904 transitions. [2019-09-10 02:30:19,711 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 904 transitions. Word has length 99 [2019-09-10 02:30:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:19,712 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 904 transitions. [2019-09-10 02:30:19,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 904 transitions. [2019-09-10 02:30:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 02:30:19,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:19,713 INFO L399 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-09-10 02:30:19,714 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:19,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:19,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1162306209, now seen corresponding path program 1 times [2019-09-10 02:30:19,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:19,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:19,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:19,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:19,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:19,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:19,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:19,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:19,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:19,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:19,883 INFO L87 Difference]: Start difference. First operand 592 states and 904 transitions. Second operand 6 states. [2019-09-10 02:30:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:20,561 INFO L93 Difference]: Finished difference Result 597 states and 909 transitions. [2019-09-10 02:30:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:20,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-10 02:30:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:20,567 INFO L225 Difference]: With dead ends: 597 [2019-09-10 02:30:20,567 INFO L226 Difference]: Without dead ends: 597 [2019-09-10 02:30:20,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:30:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-10 02:30:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-09-10 02:30:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-10 02:30:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 909 transitions. [2019-09-10 02:30:20,590 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 909 transitions. Word has length 100 [2019-09-10 02:30:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:20,590 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 909 transitions. [2019-09-10 02:30:20,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 909 transitions. [2019-09-10 02:30:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 02:30:20,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:20,592 INFO L399 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-09-10 02:30:20,592 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2097760514, now seen corresponding path program 1 times [2019-09-10 02:30:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:20,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:20,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:20,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:20,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:20,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:20,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:20,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:20,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:20,697 INFO L87 Difference]: Start difference. First operand 597 states and 909 transitions. Second operand 6 states. [2019-09-10 02:30:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:21,361 INFO L93 Difference]: Finished difference Result 603 states and 915 transitions. [2019-09-10 02:30:21,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:21,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-10 02:30:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:21,366 INFO L225 Difference]: With dead ends: 603 [2019-09-10 02:30:21,366 INFO L226 Difference]: Without dead ends: 603 [2019-09-10 02:30:21,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:30:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-10 02:30:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-09-10 02:30:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-10 02:30:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 915 transitions. [2019-09-10 02:30:21,382 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 915 transitions. Word has length 101 [2019-09-10 02:30:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:21,383 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 915 transitions. [2019-09-10 02:30:21,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 915 transitions. [2019-09-10 02:30:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 02:30:21,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:21,385 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:21,385 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:21,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:21,385 INFO L82 PathProgramCache]: Analyzing trace with hash -367897405, now seen corresponding path program 1 times [2019-09-10 02:30:21,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:21,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:21,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:21,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:21,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:21,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:21,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:21,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:21,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:21,528 INFO L87 Difference]: Start difference. First operand 603 states and 915 transitions. Second operand 6 states. [2019-09-10 02:30:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:22,183 INFO L93 Difference]: Finished difference Result 610 states and 922 transitions. [2019-09-10 02:30:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:22,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-10 02:30:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:22,188 INFO L225 Difference]: With dead ends: 610 [2019-09-10 02:30:22,188 INFO L226 Difference]: Without dead ends: 610 [2019-09-10 02:30:22,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:30:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-10 02:30:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-09-10 02:30:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-10 02:30:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 922 transitions. [2019-09-10 02:30:22,204 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 922 transitions. Word has length 102 [2019-09-10 02:30:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:22,205 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 922 transitions. [2019-09-10 02:30:22,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 922 transitions. [2019-09-10 02:30:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 02:30:22,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:22,207 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:22,207 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:22,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash 57607206, now seen corresponding path program 1 times [2019-09-10 02:30:22,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:22,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:22,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:22,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:30:22,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:22,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:30:22,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:30:22,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:30:22,338 INFO L87 Difference]: Start difference. First operand 610 states and 922 transitions. Second operand 9 states. [2019-09-10 02:30:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:28,097 INFO L93 Difference]: Finished difference Result 1247 states and 1928 transitions. [2019-09-10 02:30:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:30:28,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 02:30:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:28,105 INFO L225 Difference]: With dead ends: 1247 [2019-09-10 02:30:28,106 INFO L226 Difference]: Without dead ends: 1178 [2019-09-10 02:30:28,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:30:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-09-10 02:30:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1170. [2019-09-10 02:30:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-09-10 02:30:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1817 transitions. [2019-09-10 02:30:28,140 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1817 transitions. Word has length 103 [2019-09-10 02:30:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:28,141 INFO L475 AbstractCegarLoop]: Abstraction has 1170 states and 1817 transitions. [2019-09-10 02:30:28,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:30:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1817 transitions. [2019-09-10 02:30:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:30:28,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:28,143 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:28,143 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1752163743, now seen corresponding path program 1 times [2019-09-10 02:30:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:28,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:28,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:30:28,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:28,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:30:28,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:28,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:30:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:30:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:30:28,260 INFO L87 Difference]: Start difference. First operand 1170 states and 1817 transitions. Second operand 9 states. [2019-09-10 02:30:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:28,435 INFO L93 Difference]: Finished difference Result 1128 states and 1752 transitions. [2019-09-10 02:30:28,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:30:28,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-09-10 02:30:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:28,442 INFO L225 Difference]: With dead ends: 1128 [2019-09-10 02:30:28,442 INFO L226 Difference]: Without dead ends: 1065 [2019-09-10 02:30:28,442 INFO L628 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-09-10 02:30:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-09-10 02:30:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2019-09-10 02:30:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-09-10 02:30:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1644 transitions. [2019-09-10 02:30:28,471 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1644 transitions. Word has length 106 [2019-09-10 02:30:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:28,471 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1644 transitions. [2019-09-10 02:30:28,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:30:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1644 transitions. [2019-09-10 02:30:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 02:30:28,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:28,477 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:28,477 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:28,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash -175364120, now seen corresponding path program 1 times [2019-09-10 02:30:28,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:28,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:28,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 38 proven. 42 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-10 02:30:28,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:30:28,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:30:28,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2019-09-10 02:30:28,674 INFO L207 CegarAbsIntRunner]: [60], [61], [140], [144], [147], [338], [340], [342], [393], [394], [396], [397], [458], [460], [462], [537], [539], [542], [545], [555], [556], [600], [601], [602], [607], [640], [641], [725], [761], [764], [767], [769], [774], [779], [784], [789], [792], [908], [913], [914], [918], [963], [968], [971], [973], [978], [983], [986], [990], [1175], [1178], [1179], [1183], [1187], [1191], [1195], [1198], [1200], [1243], [1245], [1248], [1250], [1252], [1257], [1259], [1262], [1268], [1270], [1368], [1369], [1645], [1979], [1983], [1987], [1991], [1995], [1998], [2000], [2386], [2387], [2388], [2389], [2390], [2391], [2392], [2393], [2394], [2404], [2405], [2406], [2407], [2432], [2433], [2440], [2441], [2442], [2443], [2444], [2445], [2446], [2447], [2448], [2449], [2450], [2474], [2475], [2480], [2481], [2482], [2508], [2509], [2510], [2511], [2512], [2513], [2514], [2515], [2536], [2542], [2543], [2544], [2545], [2546], [2547], [2548], [2549], [2550], [2596], [2597], [2598] [2019-09-10 02:30:28,735 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:30:28,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:30:28,836 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:30:28,838 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 135 root evaluator evaluations with a maximum evaluation depth of 0. Performed 135 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 260 variables. [2019-09-10 02:30:28,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:28,851 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:30:28,928 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:30:28,928 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:30:28,938 INFO L420 sIntCurrentIteration]: We unified 225 AI predicates to 225 [2019-09-10 02:30:28,939 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:30:28,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:30:28,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-10 02:30:28,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:28,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:30:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:30:28,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:30:28,941 INFO L87 Difference]: Start difference. First operand 1065 states and 1644 transitions. Second operand 2 states. [2019-09-10 02:30:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:28,943 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:30:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:30:28,943 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 226 [2019-09-10 02:30:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:28,944 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:30:28,944 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:30:28,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 225 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-09-10 02:30:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:30:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:30:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:30:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:30:28,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2019-09-10 02:30:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:28,945 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:30:28,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:30:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:30:28,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:30:28,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:30:28 BoogieIcfgContainer [2019-09-10 02:30:28,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:30:28,958 INFO L168 Benchmark]: Toolchain (without parser) took 19403.41 ms. Allocated memory was 135.3 MB in the beginning and 536.9 MB in the end (delta: 401.6 MB). Free memory was 87.5 MB in the beginning and 93.4 MB in the end (delta: -6.0 MB). Peak memory consumption was 395.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:28,959 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-10 02:30:28,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1068.76 ms. Allocated memory was 135.3 MB in the beginning and 203.4 MB in the end (delta: 68.2 MB). Free memory was 87.3 MB in the beginning and 142.3 MB in the end (delta: -55.1 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:28,960 INFO L168 Benchmark]: Boogie Preprocessor took 182.27 ms. Allocated memory is still 203.4 MB. Free memory was 142.3 MB in the beginning and 133.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:28,962 INFO L168 Benchmark]: RCFGBuilder took 2610.26 ms. Allocated memory was 203.4 MB in the beginning and 257.9 MB in the end (delta: 54.5 MB). Free memory was 133.3 MB in the beginning and 141.6 MB in the end (delta: -8.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:28,965 INFO L168 Benchmark]: TraceAbstraction took 15536.87 ms. Allocated memory was 257.9 MB in the beginning and 536.9 MB in the end (delta: 278.9 MB). Free memory was 141.6 MB in the beginning and 93.4 MB in the end (delta: 48.2 MB). Peak memory consumption was 327.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:30:28,974 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.24 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1068.76 ms. Allocated memory was 135.3 MB in the beginning and 203.4 MB in the end (delta: 68.2 MB). Free memory was 87.3 MB in the beginning and 142.3 MB in the end (delta: -55.1 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.27 ms. Allocated memory is still 203.4 MB. Free memory was 142.3 MB in the beginning and 133.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2610.26 ms. Allocated memory was 203.4 MB in the beginning and 257.9 MB in the end (delta: 54.5 MB). Free memory was 133.3 MB in the beginning and 141.6 MB in the end (delta: -8.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15536.87 ms. Allocated memory was 257.9 MB in the beginning and 536.9 MB in the end (delta: 278.9 MB). Free memory was 141.6 MB in the beginning and 93.4 MB in the end (delta: 48.2 MB). Peak memory consumption was 327.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3310]: 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 77 procedures, 894 locations, 1 error locations. SAFE Result, 15.4s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17703 SDtfs, 5916 SDslu, 65469 SDs, 0 SdLazy, 8335 SolverSat, 702 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1170occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.1822222222222223 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2134 NumberOfCodeBlocks, 2134 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2113 ConstructedInterpolants, 0 QuantifiedInterpolants, 326604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 214/256 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...