java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:43:03,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:43:03,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:43:03,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:43:03,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:43:03,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:43:03,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:43:03,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:43:03,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:43:03,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:43:03,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:43:03,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:43:03,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:43:03,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:43:03,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:43:03,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:43:03,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:43:03,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:43:03,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:43:03,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:43:03,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:43:03,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:43:03,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:43:03,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:43:03,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:43:03,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:43:03,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:43:03,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:43:03,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:43:03,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:43:03,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:43:03,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:43:03,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:43:03,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:43:03,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:43:03,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:43:03,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:43:03,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:43:03,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:43:03,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:43:03,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:43:03,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:43:03,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:43:03,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:43:03,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:43:03,669 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:43:03,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:43:03,670 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:43:03,670 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:43:03,670 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:43:03,670 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:43:03,670 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:43:03,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:43:03,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:43:03,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:43:03,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:43:03,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:43:03,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:43:03,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:43:03,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:43:03,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:43:03,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:43:03,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:43:03,675 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:43:03,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:43:03,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:43:03,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:43:03,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:43:03,676 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:43:03,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:43:03,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:43:03,676 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:43:03,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:43:03,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:43:03,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:43:03,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:43:03,723 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:43:03,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product28.cil.c [2019-10-03 02:43:03,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae201c8a/9a89757d27664b9b9bdb03e3c67439e1/FLAG8129a2482 [2019-10-03 02:43:04,413 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:43:04,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product28.cil.c [2019-10-03 02:43:04,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae201c8a/9a89757d27664b9b9bdb03e3c67439e1/FLAG8129a2482 [2019-10-03 02:43:04,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae201c8a/9a89757d27664b9b9bdb03e3c67439e1 [2019-10-03 02:43:04,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:43:04,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:43:04,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:43:04,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:43:04,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:43:04,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:43:04" (1/1) ... [2019-10-03 02:43:04,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5d2151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:04, skipping insertion in model container [2019-10-03 02:43:04,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:43:04" (1/1) ... [2019-10-03 02:43:04,649 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:43:04,745 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:43:05,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:43:05,524 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:43:05,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:43:05,789 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:43:05,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05 WrapperNode [2019-10-03 02:43:05,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:43:05,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:43:05,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:43:05,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:43:05,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (1/1) ... [2019-10-03 02:43:05,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (1/1) ... [2019-10-03 02:43:05,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (1/1) ... [2019-10-03 02:43:05,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (1/1) ... [2019-10-03 02:43:05,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (1/1) ... [2019-10-03 02:43:05,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (1/1) ... [2019-10-03 02:43:05,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (1/1) ... [2019-10-03 02:43:05,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:43:05,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:43:05,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:43:05,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:43:05,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:43:06,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:43:06,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:43:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:43:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:43:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:43:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:43:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:43:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:43:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:43:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:43:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:43:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:43:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:43:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:43:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:43:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:43:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:43:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:43:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:43:06,106 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:43:06,106 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:43:06,106 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:43:06,106 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:43:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:43:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:43:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:43:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:43:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:43:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-03 02:43:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:43:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-03 02:43:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:43:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:43:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:43:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:43:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:43:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:43:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:43:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:43:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:43:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:43:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:43:06,110 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:43:06,110 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:43:06,110 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:43:06,110 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:43:06,110 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:43:06,110 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:43:06,111 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:43:06,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:43:06,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:43:06,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:43:06,111 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:43:06,111 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:43:06,112 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:43:06,112 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:43:06,112 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:43:06,112 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:43:06,112 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:43:06,112 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:43:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:43:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:43:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:43:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:43:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:43:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:43:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:43:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:43:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:43:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:43:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:43:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:43:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:43:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:43:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:43:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:43:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:43:06,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:43:06,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:43:06,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:43:06,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:43:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:43:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:43:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:43:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:43:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:43:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:43:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:43:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:43:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:43:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:43:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:43:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:43:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:43:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:43:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:43:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:43:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:43:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:43:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:43:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:43:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:43:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:43:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:43:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:43:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:43:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:43:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:43:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:43:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:43:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:43:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:43:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:43:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:43:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:43:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:43:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:43:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:43:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:43:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:43:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:43:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:43:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-03 02:43:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:43:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-03 02:43:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:43:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:43:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:43:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:43:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:43:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:43:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:43:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:43:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:43:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:43:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:43:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:43:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:43:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:43:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:43:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:43:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:43:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:43:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:43:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:43:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:43:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:43:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:43:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:43:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:43:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:43:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:43:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:43:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:43:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:43:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:43:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:43:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:43:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:43:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:43:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:43:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:43:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:43:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:43:06,129 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:43:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:43:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:43:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:43:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:43:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:43:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:43:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:43:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:43:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:43:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:43:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:43:06,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:43:08,740 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:43:08,740 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:43:08,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:43:08 BoogieIcfgContainer [2019-10-03 02:43:08,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:43:08,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:43:08,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:43:08,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:43:08,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:43:04" (1/3) ... [2019-10-03 02:43:08,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7509b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:43:08, skipping insertion in model container [2019-10-03 02:43:08,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:05" (2/3) ... [2019-10-03 02:43:08,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7509b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:43:08, skipping insertion in model container [2019-10-03 02:43:08,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:43:08" (3/3) ... [2019-10-03 02:43:08,754 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product28.cil.c [2019-10-03 02:43:08,765 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:43:08,778 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:43:08,796 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:43:08,827 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:43:08,827 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:43:08,827 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:43:08,827 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:43:08,827 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:43:08,827 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:43:08,828 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:43:08,828 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:43:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states. [2019-10-03 02:43:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:43:08,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:08,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:08,891 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash -247911758, now seen corresponding path program 1 times [2019-10-03 02:43:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:08,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:08,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:08,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:08,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:09,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:09,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:09,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:09,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:09,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:09,544 INFO L87 Difference]: Start difference. First operand 802 states. Second operand 4 states. [2019-10-03 02:43:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:09,765 INFO L93 Difference]: Finished difference Result 646 states and 1021 transitions. [2019-10-03 02:43:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:09,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-03 02:43:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:09,806 INFO L225 Difference]: With dead ends: 646 [2019-10-03 02:43:09,806 INFO L226 Difference]: Without dead ends: 635 [2019-10-03 02:43:09,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-03 02:43:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-03 02:43:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-03 02:43:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1009 transitions. [2019-10-03 02:43:09,936 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1009 transitions. Word has length 85 [2019-10-03 02:43:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:09,937 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 1009 transitions. [2019-10-03 02:43:09,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1009 transitions. [2019-10-03 02:43:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:43:09,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:09,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:09,948 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1599117105, now seen corresponding path program 1 times [2019-10-03 02:43:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:09,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:09,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:10,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:10,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:10,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:10,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:10,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:10,251 INFO L87 Difference]: Start difference. First operand 635 states and 1009 transitions. Second operand 4 states. [2019-10-03 02:43:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:10,328 INFO L93 Difference]: Finished difference Result 637 states and 1010 transitions. [2019-10-03 02:43:10,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:10,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-03 02:43:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:10,337 INFO L225 Difference]: With dead ends: 637 [2019-10-03 02:43:10,338 INFO L226 Difference]: Without dead ends: 635 [2019-10-03 02:43:10,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-03 02:43:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-03 02:43:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-03 02:43:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1008 transitions. [2019-10-03 02:43:10,398 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1008 transitions. Word has length 88 [2019-10-03 02:43:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:10,398 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 1008 transitions. [2019-10-03 02:43:10,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1008 transitions. [2019-10-03 02:43:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 02:43:10,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:10,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:10,403 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:10,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:10,403 INFO L82 PathProgramCache]: Analyzing trace with hash 246537377, now seen corresponding path program 1 times [2019-10-03 02:43:10,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:10,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:10,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:10,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:10,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:10,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:10,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:10,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:10,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:10,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:10,612 INFO L87 Difference]: Start difference. First operand 635 states and 1008 transitions. Second operand 4 states. [2019-10-03 02:43:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:10,669 INFO L93 Difference]: Finished difference Result 637 states and 1009 transitions. [2019-10-03 02:43:10,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:10,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-03 02:43:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:10,675 INFO L225 Difference]: With dead ends: 637 [2019-10-03 02:43:10,675 INFO L226 Difference]: Without dead ends: 635 [2019-10-03 02:43:10,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-03 02:43:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-03 02:43:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-03 02:43:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1007 transitions. [2019-10-03 02:43:10,703 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1007 transitions. Word has length 89 [2019-10-03 02:43:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:10,703 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 1007 transitions. [2019-10-03 02:43:10,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1007 transitions. [2019-10-03 02:43:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:43:10,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:10,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:10,708 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1708600971, now seen corresponding path program 1 times [2019-10-03 02:43:10,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:10,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:10,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:10,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:10,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:10,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:10,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:10,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:10,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:10,840 INFO L87 Difference]: Start difference. First operand 635 states and 1007 transitions. Second operand 4 states. [2019-10-03 02:43:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:10,884 INFO L93 Difference]: Finished difference Result 637 states and 1008 transitions. [2019-10-03 02:43:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:10,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-03 02:43:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:10,890 INFO L225 Difference]: With dead ends: 637 [2019-10-03 02:43:10,890 INFO L226 Difference]: Without dead ends: 635 [2019-10-03 02:43:10,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-03 02:43:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-03 02:43:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-03 02:43:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1006 transitions. [2019-10-03 02:43:10,915 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1006 transitions. Word has length 90 [2019-10-03 02:43:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:10,916 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 1006 transitions. [2019-10-03 02:43:10,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1006 transitions. [2019-10-03 02:43:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:43:10,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:10,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:10,919 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash -130718371, now seen corresponding path program 1 times [2019-10-03 02:43:10,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:10,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:10,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:10,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:10,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:11,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:11,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:11,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:11,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:11,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:11,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:11,104 INFO L87 Difference]: Start difference. First operand 635 states and 1006 transitions. Second operand 4 states. [2019-10-03 02:43:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:11,171 INFO L93 Difference]: Finished difference Result 637 states and 1007 transitions. [2019-10-03 02:43:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:11,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:43:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:11,180 INFO L225 Difference]: With dead ends: 637 [2019-10-03 02:43:11,180 INFO L226 Difference]: Without dead ends: 635 [2019-10-03 02:43:11,181 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-03 02:43:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-03 02:43:11,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-03 02:43:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1005 transitions. [2019-10-03 02:43:11,207 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1005 transitions. Word has length 91 [2019-10-03 02:43:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:11,207 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 1005 transitions. [2019-10-03 02:43:11,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1005 transitions. [2019-10-03 02:43:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:43:11,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:11,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:11,210 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:11,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1233693625, now seen corresponding path program 1 times [2019-10-03 02:43:11,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:11,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:11,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:43:11,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:11,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:43:11,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:43:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:43:11,446 INFO L87 Difference]: Start difference. First operand 635 states and 1005 transitions. Second operand 10 states. [2019-10-03 02:43:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:11,619 INFO L93 Difference]: Finished difference Result 644 states and 1016 transitions. [2019-10-03 02:43:11,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:43:11,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-03 02:43:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:11,625 INFO L225 Difference]: With dead ends: 644 [2019-10-03 02:43:11,625 INFO L226 Difference]: Without dead ends: 644 [2019-10-03 02:43:11,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:43:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-03 02:43:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2019-10-03 02:43:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-03 02:43:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1014 transitions. [2019-10-03 02:43:11,654 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1014 transitions. Word has length 92 [2019-10-03 02:43:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:11,655 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1014 transitions. [2019-10-03 02:43:11,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:43:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1014 transitions. [2019-10-03 02:43:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:43:11,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:11,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:11,658 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:11,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:11,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1213356250, now seen corresponding path program 1 times [2019-10-03 02:43:11,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:11,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:11,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:11,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:11,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:11,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:11,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:11,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:11,777 INFO L87 Difference]: Start difference. First operand 642 states and 1014 transitions. Second operand 4 states. [2019-10-03 02:43:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:11,831 INFO L93 Difference]: Finished difference Result 640 states and 1009 transitions. [2019-10-03 02:43:11,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:11,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:43:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:11,837 INFO L225 Difference]: With dead ends: 640 [2019-10-03 02:43:11,837 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:11,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 991 transitions. [2019-10-03 02:43:11,861 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 991 transitions. Word has length 92 [2019-10-03 02:43:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:11,862 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 991 transitions. [2019-10-03 02:43:11,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 991 transitions. [2019-10-03 02:43:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:43:11,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:11,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:11,865 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:11,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash -753982501, now seen corresponding path program 1 times [2019-10-03 02:43:11,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:11,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:11,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:11,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:11,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:11,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:11,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:11,997 INFO L87 Difference]: Start difference. First operand 629 states and 991 transitions. Second operand 6 states. [2019-10-03 02:43:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:12,243 INFO L93 Difference]: Finished difference Result 632 states and 994 transitions. [2019-10-03 02:43:12,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:12,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-03 02:43:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:12,249 INFO L225 Difference]: With dead ends: 632 [2019-10-03 02:43:12,249 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:12,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 987 transitions. [2019-10-03 02:43:12,275 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 987 transitions. Word has length 93 [2019-10-03 02:43:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:12,275 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 987 transitions. [2019-10-03 02:43:12,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 987 transitions. [2019-10-03 02:43:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:43:12,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:12,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:12,278 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1319589162, now seen corresponding path program 1 times [2019-10-03 02:43:12,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:12,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:12,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:12,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:12,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:12,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:12,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:12,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:12,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:12,524 INFO L87 Difference]: Start difference. First operand 629 states and 987 transitions. Second operand 6 states. [2019-10-03 02:43:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:12,780 INFO L93 Difference]: Finished difference Result 632 states and 990 transitions. [2019-10-03 02:43:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:12,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-03 02:43:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:12,788 INFO L225 Difference]: With dead ends: 632 [2019-10-03 02:43:12,788 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:12,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 983 transitions. [2019-10-03 02:43:12,814 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 983 transitions. Word has length 94 [2019-10-03 02:43:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:12,814 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 983 transitions. [2019-10-03 02:43:12,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 983 transitions. [2019-10-03 02:43:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:43:12,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:12,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:12,816 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1137004480, now seen corresponding path program 1 times [2019-10-03 02:43:12,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:12,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:12,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:12,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:12,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:12,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:12,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:12,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:12,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:12,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:12,951 INFO L87 Difference]: Start difference. First operand 629 states and 983 transitions. Second operand 6 states. [2019-10-03 02:43:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:13,141 INFO L93 Difference]: Finished difference Result 632 states and 986 transitions. [2019-10-03 02:43:13,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:13,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 02:43:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:13,148 INFO L225 Difference]: With dead ends: 632 [2019-10-03 02:43:13,148 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:13,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 979 transitions. [2019-10-03 02:43:13,171 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 979 transitions. Word has length 95 [2019-10-03 02:43:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:13,172 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 979 transitions. [2019-10-03 02:43:13,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 979 transitions. [2019-10-03 02:43:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:43:13,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:13,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:13,178 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:13,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2110108608, now seen corresponding path program 1 times [2019-10-03 02:43:13,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:13,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:13,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:13,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:13,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:43:13,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:13,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:43:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:43:13,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:43:13,324 INFO L87 Difference]: Start difference. First operand 629 states and 979 transitions. Second operand 7 states. [2019-10-03 02:43:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:13,403 INFO L93 Difference]: Finished difference Result 632 states and 982 transitions. [2019-10-03 02:43:13,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:43:13,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-03 02:43:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:13,409 INFO L225 Difference]: With dead ends: 632 [2019-10-03 02:43:13,409 INFO L226 Difference]: Without dead ends: 608 [2019-10-03 02:43:13,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-03 02:43:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-03 02:43:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-03 02:43:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 945 transitions. [2019-10-03 02:43:13,432 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 945 transitions. Word has length 95 [2019-10-03 02:43:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:13,434 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 945 transitions. [2019-10-03 02:43:13,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:43:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 945 transitions. [2019-10-03 02:43:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:43:13,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:13,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:13,436 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -266950161, now seen corresponding path program 1 times [2019-10-03 02:43:13,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:13,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:13,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:13,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:13,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:13,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:13,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:13,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:13,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:13,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:13,572 INFO L87 Difference]: Start difference. First operand 608 states and 945 transitions. Second operand 6 states. [2019-10-03 02:43:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:13,675 INFO L93 Difference]: Finished difference Result 611 states and 948 transitions. [2019-10-03 02:43:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:13,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:43:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:13,681 INFO L225 Difference]: With dead ends: 611 [2019-10-03 02:43:13,681 INFO L226 Difference]: Without dead ends: 608 [2019-10-03 02:43:13,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-03 02:43:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-03 02:43:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-03 02:43:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 944 transitions. [2019-10-03 02:43:13,730 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 944 transitions. Word has length 96 [2019-10-03 02:43:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:13,730 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 944 transitions. [2019-10-03 02:43:13,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 944 transitions. [2019-10-03 02:43:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:43:13,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:13,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:13,733 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash -878667867, now seen corresponding path program 1 times [2019-10-03 02:43:13,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:13,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:13,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:13,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:13,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:13,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:13,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:13,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:13,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:13,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:13,851 INFO L87 Difference]: Start difference. First operand 608 states and 944 transitions. Second operand 6 states. [2019-10-03 02:43:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:13,937 INFO L93 Difference]: Finished difference Result 611 states and 947 transitions. [2019-10-03 02:43:13,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:13,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-03 02:43:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:13,942 INFO L225 Difference]: With dead ends: 611 [2019-10-03 02:43:13,942 INFO L226 Difference]: Without dead ends: 608 [2019-10-03 02:43:13,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-03 02:43:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-03 02:43:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-03 02:43:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 943 transitions. [2019-10-03 02:43:13,962 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 943 transitions. Word has length 97 [2019-10-03 02:43:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:13,962 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 943 transitions. [2019-10-03 02:43:13,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 943 transitions. [2019-10-03 02:43:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:43:13,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:13,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:13,964 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1594122932, now seen corresponding path program 1 times [2019-10-03 02:43:13,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:13,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:13,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:13,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:13,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:14,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:14,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:43:14,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:14,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:43:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:43:14,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:43:14,139 INFO L87 Difference]: Start difference. First operand 608 states and 943 transitions. Second operand 12 states. [2019-10-03 02:43:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:14,315 INFO L93 Difference]: Finished difference Result 612 states and 946 transitions. [2019-10-03 02:43:14,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:43:14,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-03 02:43:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:14,320 INFO L225 Difference]: With dead ends: 612 [2019-10-03 02:43:14,320 INFO L226 Difference]: Without dead ends: 608 [2019-10-03 02:43:14,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:43:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-03 02:43:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-03 02:43:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-03 02:43:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 942 transitions. [2019-10-03 02:43:14,338 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 942 transitions. Word has length 98 [2019-10-03 02:43:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:14,339 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 942 transitions. [2019-10-03 02:43:14,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:43:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 942 transitions. [2019-10-03 02:43:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:43:14,340 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:14,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:14,341 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:14,341 INFO L82 PathProgramCache]: Analyzing trace with hash -679219796, now seen corresponding path program 1 times [2019-10-03 02:43:14,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:14,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:14,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:14,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:14,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:14,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:14,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:14,511 INFO L87 Difference]: Start difference. First operand 608 states and 942 transitions. Second operand 6 states. [2019-10-03 02:43:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:18,226 INFO L93 Difference]: Finished difference Result 1246 states and 1983 transitions. [2019-10-03 02:43:18,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:18,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-03 02:43:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:18,236 INFO L225 Difference]: With dead ends: 1246 [2019-10-03 02:43:18,236 INFO L226 Difference]: Without dead ends: 1246 [2019-10-03 02:43:18,237 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-10-03 02:43:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1119. [2019-10-03 02:43:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-10-03 02:43:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1781 transitions. [2019-10-03 02:43:18,275 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1781 transitions. Word has length 99 [2019-10-03 02:43:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:18,275 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1781 transitions. [2019-10-03 02:43:18,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1781 transitions. [2019-10-03 02:43:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:43:18,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:18,280 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:18,280 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:18,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:18,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1954757833, now seen corresponding path program 1 times [2019-10-03 02:43:18,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:18,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:18,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:43:18,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:18,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:43:18,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:18,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:43:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:43:18,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:43:18,475 INFO L87 Difference]: Start difference. First operand 1119 states and 1781 transitions. Second operand 12 states. [2019-10-03 02:43:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:30,410 INFO L93 Difference]: Finished difference Result 2565 states and 4042 transitions. [2019-10-03 02:43:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:43:30,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-10-03 02:43:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:30,425 INFO L225 Difference]: With dead ends: 2565 [2019-10-03 02:43:30,425 INFO L226 Difference]: Without dead ends: 2565 [2019-10-03 02:43:30,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-03 02:43:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-10-03 02:43:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2507. [2019-10-03 02:43:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-10-03 02:43:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3962 transitions. [2019-10-03 02:43:30,508 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3962 transitions. Word has length 157 [2019-10-03 02:43:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:30,509 INFO L475 AbstractCegarLoop]: Abstraction has 2507 states and 3962 transitions. [2019-10-03 02:43:30,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:43:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3962 transitions. [2019-10-03 02:43:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:43:30,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:30,514 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:30,514 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash -909350594, now seen corresponding path program 1 times [2019-10-03 02:43:30,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:30,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:30,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:30,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:30,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-03 02:43:30,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:43:30,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:43:30,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-10-03 02:43:30,669 INFO L207 CegarAbsIntRunner]: [57], [58], [320], [324], [327], [343], [345], [347], [384], [385], [387], [388], [389], [391], [394], [396], [400], [462], [856], [858], [877], [897], [917], [937], [957], [959], [988], [989], [990], [992], [995], [1000], [1008], [1009], [1011], [1020], [1022], [1035], [1048], [1051], [1085], [1086], [1087], [1092], [1125], [1126], [1206], [1208], [1211], [1213], [1219], [1223], [1226], [1262], [1265], [1270], [1275], [1280], [1285], [1290], [1293], [1409], [1418], [1423], [1426], [1445], [1676], [1680], [1684], [1688], [1692], [1696], [1699], [1701], [1702], [1715], [1718], [1724], [1728], [1841], [1842], [2125], [2129], [2132], [2150], [2361], [2363], [2460], [2463], [2468], [2471], [2489], [2540], [2541], [2542], [2543], [2544], [2545], [2546], [2547], [2548], [2558], [2559], [2560], [2561], [2582], [2583], [2584], [2585], [2586], [2587], [2594], [2595], [2596], [2597], [2642], [2643], [2654], [2655], [2656], [2657], [2660], [2661], [2662], [2663], [2670], [2694], [2695], [2696], [2697], [2702], [2703], [2710], [2711], [2712], [2713], [2714], [2764], [2765], [2766], [2846], [2847], [2876], [2877], [2878], [2879] [2019-10-03 02:43:30,729 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:43:30,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:43:30,849 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:43:30,851 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 156 root evaluator evaluations with a maximum evaluation depth of 0. Performed 156 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 270 variables. [2019-10-03 02:43:30,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:30,855 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:43:30,955 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:43:30,955 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:43:30,964 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-10-03 02:43:30,965 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:43:30,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:43:30,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:43:30,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:30,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:43:30,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:43:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:43:30,967 INFO L87 Difference]: Start difference. First operand 2507 states and 3962 transitions. Second operand 2 states. [2019-10-03 02:43:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:30,968 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:43:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:43:30,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-03 02:43:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:30,969 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:43:30,969 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:43:30,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:43:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:43:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:43:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:43:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:43:30,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2019-10-03 02:43:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:30,970 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:43:30,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:43:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:43:30,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:43:30,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:43:30 BoogieIcfgContainer [2019-10-03 02:43:30,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:43:30,981 INFO L168 Benchmark]: Toolchain (without parser) took 26346.79 ms. Allocated memory was 136.8 MB in the beginning and 641.2 MB in the end (delta: 504.4 MB). Free memory was 81.2 MB in the beginning and 269.4 MB in the end (delta: -188.1 MB). Peak memory consumption was 316.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:43:30,982 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 102.9 MB in the beginning and 102.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:43:30,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1157.20 ms. Allocated memory was 136.8 MB in the beginning and 198.2 MB in the end (delta: 61.3 MB). Free memory was 81.0 MB in the beginning and 134.9 MB in the end (delta: -53.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:43:30,988 INFO L168 Benchmark]: Boogie Preprocessor took 202.55 ms. Allocated memory is still 198.2 MB. Free memory was 134.9 MB in the beginning and 125.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:43:30,989 INFO L168 Benchmark]: RCFGBuilder took 2748.82 ms. Allocated memory was 198.2 MB in the beginning and 278.9 MB in the end (delta: 80.7 MB). Free memory was 125.1 MB in the beginning and 156.9 MB in the end (delta: -31.7 MB). Peak memory consumption was 90.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:43:30,990 INFO L168 Benchmark]: TraceAbstraction took 22232.12 ms. Allocated memory was 278.9 MB in the beginning and 641.2 MB in the end (delta: 362.3 MB). Free memory was 156.9 MB in the beginning and 269.4 MB in the end (delta: -112.5 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:43:31,002 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.25 ms. Allocated memory is still 136.8 MB. Free memory was 102.9 MB in the beginning and 102.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1157.20 ms. Allocated memory was 136.8 MB in the beginning and 198.2 MB in the end (delta: 61.3 MB). Free memory was 81.0 MB in the beginning and 134.9 MB in the end (delta: -53.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.55 ms. Allocated memory is still 198.2 MB. Free memory was 134.9 MB in the beginning and 125.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2748.82 ms. Allocated memory was 198.2 MB in the beginning and 278.9 MB in the end (delta: 80.7 MB). Free memory was 125.1 MB in the beginning and 156.9 MB in the end (delta: -31.7 MB). Peak memory consumption was 90.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22232.12 ms. Allocated memory was 278.9 MB in the beginning and 641.2 MB in the end (delta: 362.3 MB). Free memory was 156.9 MB in the beginning and 269.4 MB in the end (delta: -112.5 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1697]: 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 81 procedures, 940 locations, 1 error locations. SAFE Result, 22.1s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16105 SDtfs, 4520 SDslu, 54397 SDs, 0 SdLazy, 16767 SolverSat, 1390 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2507occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.605095541401274 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1692 ConstructedInterpolants, 0 QuantifiedInterpolants, 256558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...