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_spec9_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:46:18,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:46:18,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:46:18,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:46:18,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:46:18,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:46:18,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:46:18,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:46:18,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:46:18,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:46:18,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:46:18,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:46:18,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:46:18,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:46:18,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:46:18,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:46:18,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:46:18,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:46:18,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:46:18,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:46:18,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:46:18,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:46:18,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:46:18,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:46:18,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:46:18,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:46:18,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:46:18,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:46:18,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:46:18,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:46:18,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:46:18,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:46:18,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:46:18,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:46:18,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:46:18,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:46:18,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:46:18,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:46:18,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:46:18,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:46:18,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:46:18,943 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:46:18,959 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:46:18,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:46:18,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:46:18,960 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:46:18,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:46:18,961 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:46:18,961 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:46:18,961 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:46:18,961 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:46:18,961 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:46:18,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:46:18,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:46:18,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:46:18,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:46:18,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:46:18,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:46:18,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:46:18,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:46:18,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:46:18,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:46:18,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:46:18,966 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:46:18,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:46:18,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:46:18,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:46:18,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:46:18,967 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:46:18,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:46:18,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:46:18,968 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:46:19,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:46:19,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:46:19,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:46:19,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:46:19,026 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:46:19,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-10-03 02:46:19,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/521cdce1d/fe86523e0dbe4884887bc43cff2ab2ce/FLAGba622cd96 [2019-10-03 02:46:19,757 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:46:19,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-10-03 02:46:19,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/521cdce1d/fe86523e0dbe4884887bc43cff2ab2ce/FLAGba622cd96 [2019-10-03 02:46:19,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/521cdce1d/fe86523e0dbe4884887bc43cff2ab2ce [2019-10-03 02:46:19,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:46:19,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:46:19,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:46:19,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:46:19,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:46:19,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:46:19" (1/1) ... [2019-10-03 02:46:19,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210c5ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:19, skipping insertion in model container [2019-10-03 02:46:19,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:46:19" (1/1) ... [2019-10-03 02:46:19,997 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:46:20,086 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:46:20,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:46:20,784 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:46:20,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:46:21,009 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:46:21,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21 WrapperNode [2019-10-03 02:46:21,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:46:21,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:46:21,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:46:21,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:46:21,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (1/1) ... [2019-10-03 02:46:21,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (1/1) ... [2019-10-03 02:46:21,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (1/1) ... [2019-10-03 02:46:21,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (1/1) ... [2019-10-03 02:46:21,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (1/1) ... [2019-10-03 02:46:21,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (1/1) ... [2019-10-03 02:46:21,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (1/1) ... [2019-10-03 02:46:21,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:46:21,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:46:21,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:46:21,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:46:21,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (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:46:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:46:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:46:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:46:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:46:21,280 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:46:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:46:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:46:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:46:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:46:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:46:21,281 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:46:21,282 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:46:21,282 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:46:21,283 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:46:21,283 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:46:21,284 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:46:21,284 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:46:21,284 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:46:21,284 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:46:21,284 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:46:21,285 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:46:21,285 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:46:21,285 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:46:21,285 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:46:21,286 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:46:21,286 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:46:21,286 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:46:21,286 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:46:21,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:46:21,287 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:46:21,287 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:46:21,287 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:46:21,287 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:46:21,288 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:46:21,288 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:46:21,288 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:46:21,288 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:46:21,288 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:46:21,288 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:46:21,288 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:46:21,289 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:46:21,289 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:46:21,289 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:46:21,289 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:46:21,290 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:46:21,290 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:46:21,290 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:46:21,290 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:46:21,290 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:46:21,290 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:46:21,291 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:46:21,291 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:46:21,291 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:46:21,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:46:21,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:46:21,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:46:21,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:46:21,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:46:21,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:46:21,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:46:21,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:46:21,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:46:21,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:46:21,292 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:46:21,293 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:46:21,293 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:46:21,293 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:46:21,293 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:46:21,293 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:46:21,293 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:46:21,294 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:46:21,294 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:46:21,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:46:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:46:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:46:21,294 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:46:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:46:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:46:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:46:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:46:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:46:21,295 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:46:21,296 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:46:21,296 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:46:21,296 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:46:21,296 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:46:21,296 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:46:21,296 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:46:21,296 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:46:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:46:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:46:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:46:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:46:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:46:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:46:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:46:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:46:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:46:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:46:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:46:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:46:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:46:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:46:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:46:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:46:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:46:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:46:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:46:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:46:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:46:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:46:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:46:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:46:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:46:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:46:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:46:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:46:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:46:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:46:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:46:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:46:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:46:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:46:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:46:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:46:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:46:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:46:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:46:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:46:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:46:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:46:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:46:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:46:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:46:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:46:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:46:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:46:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:46:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:46:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:46:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:46:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:46:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:46:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:46:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:46:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:46:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:46:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:46:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:46:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:46:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:46:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:46:21,307 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:46:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:46:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:46:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:46:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:46:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:46:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:46:21,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:46:21,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:46:23,713 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:46:23,713 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:46:23,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:46:23 BoogieIcfgContainer [2019-10-03 02:46:23,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:46:23,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:46:23,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:46:23,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:46:23,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:46:19" (1/3) ... [2019-10-03 02:46:23,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de4f0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:46:23, skipping insertion in model container [2019-10-03 02:46:23,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:21" (2/3) ... [2019-10-03 02:46:23,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de4f0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:46:23, skipping insertion in model container [2019-10-03 02:46:23,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:46:23" (3/3) ... [2019-10-03 02:46:23,724 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product09.cil.c [2019-10-03 02:46:23,734 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:46:23,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:46:23,762 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:46:23,794 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:46:23,795 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:46:23,795 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:46:23,795 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:46:23,795 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:46:23,795 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:46:23,795 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:46:23,796 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:46:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states. [2019-10-03 02:46:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 02:46:23,873 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:23,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:23,878 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:23,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1110601002, now seen corresponding path program 1 times [2019-10-03 02:46:23,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:23,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:23,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:23,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:23,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:24,538 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:46:24,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:24,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:24,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:24,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:24,566 INFO L87 Difference]: Start difference. First operand 728 states. Second operand 4 states. [2019-10-03 02:46:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:24,726 INFO L93 Difference]: Finished difference Result 579 states and 929 transitions. [2019-10-03 02:46:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:24,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-03 02:46:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:24,766 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:46:24,766 INFO L226 Difference]: Without dead ends: 568 [2019-10-03 02:46:24,769 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:46:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-03 02:46:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-03 02:46:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-03 02:46:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 917 transitions. [2019-10-03 02:46:24,928 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 917 transitions. Word has length 109 [2019-10-03 02:46:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:24,929 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 917 transitions. [2019-10-03 02:46:24,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 917 transitions. [2019-10-03 02:46:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 02:46:24,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:24,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:24,937 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:24,937 INFO L82 PathProgramCache]: Analyzing trace with hash 513878495, now seen corresponding path program 1 times [2019-10-03 02:46:24,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:24,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:24,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:24,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:25,161 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:46:25,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:25,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:25,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:25,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:25,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:25,165 INFO L87 Difference]: Start difference. First operand 568 states and 917 transitions. Second operand 4 states. [2019-10-03 02:46:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:25,241 INFO L93 Difference]: Finished difference Result 570 states and 918 transitions. [2019-10-03 02:46:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:25,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-03 02:46:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:25,247 INFO L225 Difference]: With dead ends: 570 [2019-10-03 02:46:25,247 INFO L226 Difference]: Without dead ends: 568 [2019-10-03 02:46:25,248 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:46:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-03 02:46:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-03 02:46:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-03 02:46:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 916 transitions. [2019-10-03 02:46:25,276 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 916 transitions. Word has length 112 [2019-10-03 02:46:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:25,276 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 916 transitions. [2019-10-03 02:46:25,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 916 transitions. [2019-10-03 02:46:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 02:46:25,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:25,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:25,282 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -899322139, now seen corresponding path program 1 times [2019-10-03 02:46:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:25,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:25,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:25,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:25,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:25,428 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:46:25,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:25,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:25,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:25,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:25,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:25,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:25,432 INFO L87 Difference]: Start difference. First operand 568 states and 916 transitions. Second operand 4 states. [2019-10-03 02:46:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:25,504 INFO L93 Difference]: Finished difference Result 570 states and 917 transitions. [2019-10-03 02:46:25,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:25,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-03 02:46:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:25,512 INFO L225 Difference]: With dead ends: 570 [2019-10-03 02:46:25,512 INFO L226 Difference]: Without dead ends: 568 [2019-10-03 02:46:25,513 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:46:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-03 02:46:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-03 02:46:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-03 02:46:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 915 transitions. [2019-10-03 02:46:25,549 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 915 transitions. Word has length 113 [2019-10-03 02:46:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:25,550 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 915 transitions. [2019-10-03 02:46:25,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 915 transitions. [2019-10-03 02:46:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 02:46:25,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:25,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:25,558 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:25,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash 251093531, now seen corresponding path program 1 times [2019-10-03 02:46:25,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:25,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:25,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:25,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:25,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:25,815 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:46:25,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:25,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:25,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:25,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:25,817 INFO L87 Difference]: Start difference. First operand 568 states and 915 transitions. Second operand 4 states. [2019-10-03 02:46:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:25,876 INFO L93 Difference]: Finished difference Result 570 states and 916 transitions. [2019-10-03 02:46:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:25,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-03 02:46:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:25,885 INFO L225 Difference]: With dead ends: 570 [2019-10-03 02:46:25,885 INFO L226 Difference]: Without dead ends: 568 [2019-10-03 02:46:25,885 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:46:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-03 02:46:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-03 02:46:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-03 02:46:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 914 transitions. [2019-10-03 02:46:25,915 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 914 transitions. Word has length 114 [2019-10-03 02:46:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:25,916 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 914 transitions. [2019-10-03 02:46:25,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 914 transitions. [2019-10-03 02:46:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 02:46:25,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:25,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:25,922 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash -730763999, now seen corresponding path program 1 times [2019-10-03 02:46:25,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:25,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:25,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:26,076 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:46:26,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:26,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:26,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:26,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:26,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:26,079 INFO L87 Difference]: Start difference. First operand 568 states and 914 transitions. Second operand 4 states. [2019-10-03 02:46:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:26,139 INFO L93 Difference]: Finished difference Result 570 states and 915 transitions. [2019-10-03 02:46:26,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:26,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-03 02:46:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:26,154 INFO L225 Difference]: With dead ends: 570 [2019-10-03 02:46:26,154 INFO L226 Difference]: Without dead ends: 568 [2019-10-03 02:46:26,155 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:46:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-03 02:46:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-03 02:46:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-03 02:46:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 913 transitions. [2019-10-03 02:46:26,181 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 913 transitions. Word has length 115 [2019-10-03 02:46:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:26,181 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 913 transitions. [2019-10-03 02:46:26,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 913 transitions. [2019-10-03 02:46:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 02:46:26,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:26,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:26,191 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash 906386007, now seen corresponding path program 1 times [2019-10-03 02:46:26,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:26,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:26,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:26,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:26,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:26,400 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:46:26,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:26,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:26,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:26,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:26,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:26,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:26,402 INFO L87 Difference]: Start difference. First operand 568 states and 913 transitions. Second operand 10 states. [2019-10-03 02:46:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:26,564 INFO L93 Difference]: Finished difference Result 577 states and 924 transitions. [2019-10-03 02:46:26,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:46:26,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-10-03 02:46:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:26,570 INFO L225 Difference]: With dead ends: 577 [2019-10-03 02:46:26,570 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:46:26,572 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:46:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:46:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-03 02:46:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-03 02:46:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 922 transitions. [2019-10-03 02:46:26,617 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 922 transitions. Word has length 116 [2019-10-03 02:46:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:26,619 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 922 transitions. [2019-10-03 02:46:26,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:46:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 922 transitions. [2019-10-03 02:46:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 02:46:26,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:26,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:26,628 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:26,629 INFO L82 PathProgramCache]: Analyzing trace with hash 335134774, now seen corresponding path program 1 times [2019-10-03 02:46:26,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:26,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:26,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:26,815 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:46:26,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:26,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:26,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:26,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:26,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:26,817 INFO L87 Difference]: Start difference. First operand 575 states and 922 transitions. Second operand 4 states. [2019-10-03 02:46:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:26,875 INFO L93 Difference]: Finished difference Result 573 states and 917 transitions. [2019-10-03 02:46:26,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:26,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-03 02:46:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:26,886 INFO L225 Difference]: With dead ends: 573 [2019-10-03 02:46:26,886 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 02:46:26,887 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:46:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 02:46:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-03 02:46:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-03 02:46:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 899 transitions. [2019-10-03 02:46:26,918 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 899 transitions. Word has length 116 [2019-10-03 02:46:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:26,919 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 899 transitions. [2019-10-03 02:46:26,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 899 transitions. [2019-10-03 02:46:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 02:46:26,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:26,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:26,924 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1313046375, now seen corresponding path program 1 times [2019-10-03 02:46:26,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:26,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:26,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:26,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:27,086 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:46:27,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:27,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:27,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:27,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:27,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:27,088 INFO L87 Difference]: Start difference. First operand 562 states and 899 transitions. Second operand 6 states. [2019-10-03 02:46:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:27,480 INFO L93 Difference]: Finished difference Result 565 states and 902 transitions. [2019-10-03 02:46:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:27,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-03 02:46:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:27,489 INFO L225 Difference]: With dead ends: 565 [2019-10-03 02:46:27,490 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 02:46:27,490 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:46:27,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 02:46:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-03 02:46:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-03 02:46:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 895 transitions. [2019-10-03 02:46:27,514 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 895 transitions. Word has length 117 [2019-10-03 02:46:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:27,515 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 895 transitions. [2019-10-03 02:46:27,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 895 transitions. [2019-10-03 02:46:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 02:46:27,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:27,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:27,520 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1293617158, now seen corresponding path program 1 times [2019-10-03 02:46:27,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:27,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:27,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:27,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:27,690 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:46:27,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:27,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:27,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:27,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:27,692 INFO L87 Difference]: Start difference. First operand 562 states and 895 transitions. Second operand 6 states. [2019-10-03 02:46:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:27,899 INFO L93 Difference]: Finished difference Result 565 states and 898 transitions. [2019-10-03 02:46:27,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:27,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-03 02:46:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:27,905 INFO L225 Difference]: With dead ends: 565 [2019-10-03 02:46:27,906 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 02:46:27,907 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:46:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 02:46:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-03 02:46:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-03 02:46:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 891 transitions. [2019-10-03 02:46:27,931 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 891 transitions. Word has length 118 [2019-10-03 02:46:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:27,932 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 891 transitions. [2019-10-03 02:46:27,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 891 transitions. [2019-10-03 02:46:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 02:46:27,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:27,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:27,937 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1173950530, now seen corresponding path program 1 times [2019-10-03 02:46:27,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:27,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:27,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:27,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:28,150 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:46:28,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:28,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:28,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:28,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:28,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:28,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:28,152 INFO L87 Difference]: Start difference. First operand 562 states and 891 transitions. Second operand 6 states. [2019-10-03 02:46:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:28,338 INFO L93 Difference]: Finished difference Result 565 states and 894 transitions. [2019-10-03 02:46:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:28,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-03 02:46:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:28,344 INFO L225 Difference]: With dead ends: 565 [2019-10-03 02:46:28,344 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 02:46:28,344 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:46:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 02:46:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-03 02:46:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-03 02:46:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 887 transitions. [2019-10-03 02:46:28,367 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 887 transitions. Word has length 119 [2019-10-03 02:46:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:28,367 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 887 transitions. [2019-10-03 02:46:28,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 887 transitions. [2019-10-03 02:46:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 02:46:28,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:28,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:28,371 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2140246978, now seen corresponding path program 1 times [2019-10-03 02:46:28,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:28,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:28,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:28,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:28,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:28,525 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:46:28,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:28,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:28,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:28,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:28,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:28,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:28,527 INFO L87 Difference]: Start difference. First operand 562 states and 887 transitions. Second operand 7 states. [2019-10-03 02:46:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:28,603 INFO L93 Difference]: Finished difference Result 565 states and 890 transitions. [2019-10-03 02:46:28,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:28,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-10-03 02:46:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:28,608 INFO L225 Difference]: With dead ends: 565 [2019-10-03 02:46:28,609 INFO L226 Difference]: Without dead ends: 541 [2019-10-03 02:46:28,610 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-03 02:46:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-03 02:46:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-03 02:46:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 853 transitions. [2019-10-03 02:46:28,629 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 853 transitions. Word has length 119 [2019-10-03 02:46:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:28,630 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 853 transitions. [2019-10-03 02:46:28,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 853 transitions. [2019-10-03 02:46:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 02:46:28,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:28,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:28,634 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2053075839, now seen corresponding path program 1 times [2019-10-03 02:46:28,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:28,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:28,772 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:46:28,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:28,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:28,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:28,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:28,775 INFO L87 Difference]: Start difference. First operand 541 states and 853 transitions. Second operand 6 states. [2019-10-03 02:46:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:28,869 INFO L93 Difference]: Finished difference Result 544 states and 856 transitions. [2019-10-03 02:46:28,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:28,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-03 02:46:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:28,874 INFO L225 Difference]: With dead ends: 544 [2019-10-03 02:46:28,874 INFO L226 Difference]: Without dead ends: 541 [2019-10-03 02:46:28,875 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:46:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-03 02:46:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-03 02:46:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-03 02:46:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 852 transitions. [2019-10-03 02:46:28,892 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 852 transitions. Word has length 120 [2019-10-03 02:46:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:28,894 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 852 transitions. [2019-10-03 02:46:28,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 852 transitions. [2019-10-03 02:46:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 02:46:28,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:28,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:28,898 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1470960925, now seen corresponding path program 1 times [2019-10-03 02:46:28,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:28,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:28,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:28,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:29,041 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:46:29,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:29,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:29,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:29,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:29,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:29,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:29,044 INFO L87 Difference]: Start difference. First operand 541 states and 852 transitions. Second operand 6 states. [2019-10-03 02:46:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:29,185 INFO L93 Difference]: Finished difference Result 544 states and 855 transitions. [2019-10-03 02:46:29,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:29,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-03 02:46:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:29,191 INFO L225 Difference]: With dead ends: 544 [2019-10-03 02:46:29,191 INFO L226 Difference]: Without dead ends: 541 [2019-10-03 02:46:29,191 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:46:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-03 02:46:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-03 02:46:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-03 02:46:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 851 transitions. [2019-10-03 02:46:29,208 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 851 transitions. Word has length 121 [2019-10-03 02:46:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:29,210 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 851 transitions. [2019-10-03 02:46:29,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 851 transitions. [2019-10-03 02:46:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 02:46:29,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:29,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:29,217 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash 470409988, now seen corresponding path program 1 times [2019-10-03 02:46:29,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:29,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:29,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:29,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:29,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:29,437 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:46:29,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:29,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:46:29,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:29,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:46:29,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:46:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:46:29,440 INFO L87 Difference]: Start difference. First operand 541 states and 851 transitions. Second operand 12 states. [2019-10-03 02:46:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:29,651 INFO L93 Difference]: Finished difference Result 545 states and 854 transitions. [2019-10-03 02:46:29,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:46:29,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-10-03 02:46:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:29,656 INFO L225 Difference]: With dead ends: 545 [2019-10-03 02:46:29,656 INFO L226 Difference]: Without dead ends: 541 [2019-10-03 02:46:29,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-03 02:46:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-03 02:46:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-03 02:46:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 850 transitions. [2019-10-03 02:46:29,676 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 850 transitions. Word has length 122 [2019-10-03 02:46:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:29,676 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 850 transitions. [2019-10-03 02:46:29,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:46:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 850 transitions. [2019-10-03 02:46:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-03 02:46:29,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:29,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:29,683 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash 213763234, now seen corresponding path program 1 times [2019-10-03 02:46:29,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:29,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:29,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:29,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:29,871 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:46:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:46:29,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:29,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:46:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:46:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:46:29,873 INFO L87 Difference]: Start difference. First operand 541 states and 850 transitions. Second operand 9 states. [2019-10-03 02:46:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:33,904 INFO L93 Difference]: Finished difference Result 547 states and 871 transitions. [2019-10-03 02:46:33,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:46:33,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-10-03 02:46:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:33,909 INFO L225 Difference]: With dead ends: 547 [2019-10-03 02:46:33,909 INFO L226 Difference]: Without dead ends: 547 [2019-10-03 02:46:33,910 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:46:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-03 02:46:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2019-10-03 02:46:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-03 02:46:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 869 transitions. [2019-10-03 02:46:33,931 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 869 transitions. Word has length 123 [2019-10-03 02:46:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:33,932 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 869 transitions. [2019-10-03 02:46:33,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:46:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 869 transitions. [2019-10-03 02:46:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-03 02:46:33,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:33,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:33,936 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:33,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 121735372, now seen corresponding path program 1 times [2019-10-03 02:46:33,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:33,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:33,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:33,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:33,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:34,158 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:46:34,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:34,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:46:34,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:34,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:46:34,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:46:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:34,163 INFO L87 Difference]: Start difference. First operand 545 states and 869 transitions. Second operand 8 states. [2019-10-03 02:46:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:40,629 INFO L93 Difference]: Finished difference Result 1427 states and 2289 transitions. [2019-10-03 02:46:40,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:46:40,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-10-03 02:46:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:40,643 INFO L225 Difference]: With dead ends: 1427 [2019-10-03 02:46:40,643 INFO L226 Difference]: Without dead ends: 1427 [2019-10-03 02:46:40,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:46:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-10-03 02:46:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1388. [2019-10-03 02:46:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-10-03 02:46:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2236 transitions. [2019-10-03 02:46:40,687 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2236 transitions. Word has length 124 [2019-10-03 02:46:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:40,688 INFO L475 AbstractCegarLoop]: Abstraction has 1388 states and 2236 transitions. [2019-10-03 02:46:40,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:46:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2236 transitions. [2019-10-03 02:46:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-03 02:46:40,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:40,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:40,692 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1651184340, now seen corresponding path program 1 times [2019-10-03 02:46:40,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:40,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:40,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:40,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:40,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:40,824 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:46:40,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:40,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:40,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:40,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:40,826 INFO L87 Difference]: Start difference. First operand 1388 states and 2236 transitions. Second operand 7 states. [2019-10-03 02:46:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:44,964 INFO L93 Difference]: Finished difference Result 2572 states and 4201 transitions. [2019-10-03 02:46:44,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:46:44,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-03 02:46:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:44,986 INFO L225 Difference]: With dead ends: 2572 [2019-10-03 02:46:44,986 INFO L226 Difference]: Without dead ends: 2572 [2019-10-03 02:46:44,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:46:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-10-03 02:46:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2516. [2019-10-03 02:46:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2019-10-03 02:46:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4112 transitions. [2019-10-03 02:46:45,071 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4112 transitions. Word has length 130 [2019-10-03 02:46:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:45,071 INFO L475 AbstractCegarLoop]: Abstraction has 2516 states and 4112 transitions. [2019-10-03 02:46:45,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4112 transitions. [2019-10-03 02:46:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:46:45,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:45,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:45,076 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash -220068901, now seen corresponding path program 1 times [2019-10-03 02:46:45,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:45,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:45,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:45,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:45,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:45,209 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:46:45,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:45,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:46:45,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:45,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:46:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:46:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:45,211 INFO L87 Difference]: Start difference. First operand 2516 states and 4112 transitions. Second operand 5 states. [2019-10-03 02:46:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:45,292 INFO L93 Difference]: Finished difference Result 2575 states and 4201 transitions. [2019-10-03 02:46:45,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:45,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-03 02:46:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:45,315 INFO L225 Difference]: With dead ends: 2575 [2019-10-03 02:46:45,315 INFO L226 Difference]: Without dead ends: 2575 [2019-10-03 02:46:45,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-10-03 02:46:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2542. [2019-10-03 02:46:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-10-03 02:46:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4149 transitions. [2019-10-03 02:46:45,456 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4149 transitions. Word has length 135 [2019-10-03 02:46:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:45,456 INFO L475 AbstractCegarLoop]: Abstraction has 2542 states and 4149 transitions. [2019-10-03 02:46:45,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4149 transitions. [2019-10-03 02:46:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:46:45,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:45,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:45,461 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:45,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1523775240, now seen corresponding path program 1 times [2019-10-03 02:46:45,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:45,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:45,590 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:46:45,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:45,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:45,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:45,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:45,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:45,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:45,593 INFO L87 Difference]: Start difference. First operand 2542 states and 4149 transitions. Second operand 7 states. [2019-10-03 02:46:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:45,807 INFO L93 Difference]: Finished difference Result 2782 states and 4534 transitions. [2019-10-03 02:46:45,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:45,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-03 02:46:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:45,830 INFO L225 Difference]: With dead ends: 2782 [2019-10-03 02:46:45,831 INFO L226 Difference]: Without dead ends: 2542 [2019-10-03 02:46:45,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2019-10-03 02:46:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2019-10-03 02:46:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-10-03 02:46:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4103 transitions. [2019-10-03 02:46:45,942 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4103 transitions. Word has length 142 [2019-10-03 02:46:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:45,945 INFO L475 AbstractCegarLoop]: Abstraction has 2542 states and 4103 transitions. [2019-10-03 02:46:45,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4103 transitions. [2019-10-03 02:46:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:46:45,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:45,952 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:45,952 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1238042262, now seen corresponding path program 1 times [2019-10-03 02:46:45,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:45,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:45,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:46:46,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:46,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:46,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:46,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:46,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:46,194 INFO L87 Difference]: Start difference. First operand 2542 states and 4103 transitions. Second operand 7 states. [2019-10-03 02:46:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:50,247 INFO L93 Difference]: Finished difference Result 2725 states and 4357 transitions. [2019-10-03 02:46:50,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:46:50,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-10-03 02:46:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:50,266 INFO L225 Difference]: With dead ends: 2725 [2019-10-03 02:46:50,267 INFO L226 Difference]: Without dead ends: 2725 [2019-10-03 02:46:50,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:46:50,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2019-10-03 02:46:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2658. [2019-10-03 02:46:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-10-03 02:46:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4259 transitions. [2019-10-03 02:46:50,356 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4259 transitions. Word has length 147 [2019-10-03 02:46:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:50,357 INFO L475 AbstractCegarLoop]: Abstraction has 2658 states and 4259 transitions. [2019-10-03 02:46:50,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4259 transitions. [2019-10-03 02:46:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-03 02:46:50,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:50,361 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:50,362 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash 115535751, now seen corresponding path program 1 times [2019-10-03 02:46:50,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:46:50,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:50,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:50,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:50,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:50,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:50,511 INFO L87 Difference]: Start difference. First operand 2658 states and 4259 transitions. Second operand 6 states. [2019-10-03 02:46:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:50,669 INFO L93 Difference]: Finished difference Result 3758 states and 6060 transitions. [2019-10-03 02:46:50,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:50,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-03 02:46:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:50,709 INFO L225 Difference]: With dead ends: 3758 [2019-10-03 02:46:50,709 INFO L226 Difference]: Without dead ends: 3758 [2019-10-03 02:46:50,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-10-03 02:46:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3524. [2019-10-03 02:46:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-10-03 02:46:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 5688 transitions. [2019-10-03 02:46:50,852 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 5688 transitions. Word has length 152 [2019-10-03 02:46:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:50,852 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 5688 transitions. [2019-10-03 02:46:50,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 5688 transitions. [2019-10-03 02:46:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-03 02:46:50,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:50,857 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:50,857 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash 43149193, now seen corresponding path program 1 times [2019-10-03 02:46:50,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:50,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:46:51,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:51,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:51,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:51,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:51,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:51,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:51,067 INFO L87 Difference]: Start difference. First operand 3524 states and 5688 transitions. Second operand 10 states. [2019-10-03 02:46:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:57,731 INFO L93 Difference]: Finished difference Result 7593 states and 12408 transitions. [2019-10-03 02:46:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:46:57,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-10-03 02:46:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:57,787 INFO L225 Difference]: With dead ends: 7593 [2019-10-03 02:46:57,787 INFO L226 Difference]: Without dead ends: 7593 [2019-10-03 02:46:57,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:46:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7593 states. [2019-10-03 02:46:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 7497. [2019-10-03 02:46:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7497 states. [2019-10-03 02:46:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7497 states to 7497 states and 12212 transitions. [2019-10-03 02:46:58,134 INFO L78 Accepts]: Start accepts. Automaton has 7497 states and 12212 transitions. Word has length 152 [2019-10-03 02:46:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:58,135 INFO L475 AbstractCegarLoop]: Abstraction has 7497 states and 12212 transitions. [2019-10-03 02:46:58,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:46:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7497 states and 12212 transitions. [2019-10-03 02:46:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:46:58,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:58,143 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:58,143 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2126949, now seen corresponding path program 1 times [2019-10-03 02:46:58,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:58,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:58,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:46:58,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:58,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:46:58,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:58,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:46:58,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:46:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:46:58,437 INFO L87 Difference]: Start difference. First operand 7497 states and 12212 transitions. Second operand 11 states. [2019-10-03 02:47:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:06,508 INFO L93 Difference]: Finished difference Result 9192 states and 14794 transitions. [2019-10-03 02:47:06,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:47:06,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 155 [2019-10-03 02:47:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:06,559 INFO L225 Difference]: With dead ends: 9192 [2019-10-03 02:47:06,560 INFO L226 Difference]: Without dead ends: 9180 [2019-10-03 02:47:06,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:47:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9180 states. [2019-10-03 02:47:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9180 to 8659. [2019-10-03 02:47:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8659 states. [2019-10-03 02:47:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8659 states to 8659 states and 13902 transitions. [2019-10-03 02:47:06,824 INFO L78 Accepts]: Start accepts. Automaton has 8659 states and 13902 transitions. Word has length 155 [2019-10-03 02:47:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:06,825 INFO L475 AbstractCegarLoop]: Abstraction has 8659 states and 13902 transitions. [2019-10-03 02:47:06,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:47:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 8659 states and 13902 transitions. [2019-10-03 02:47:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:47:06,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:06,830 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:06,831 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 695519654, now seen corresponding path program 1 times [2019-10-03 02:47:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:06,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:06,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:06,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:47:07,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:07,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:07,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:07,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:07,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:07,020 INFO L87 Difference]: Start difference. First operand 8659 states and 13902 transitions. Second operand 10 states. [2019-10-03 02:47:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:13,100 INFO L93 Difference]: Finished difference Result 18927 states and 30930 transitions. [2019-10-03 02:47:13,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:13,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-10-03 02:47:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:13,215 INFO L225 Difference]: With dead ends: 18927 [2019-10-03 02:47:13,215 INFO L226 Difference]: Without dead ends: 18927 [2019-10-03 02:47:13,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18927 states. [2019-10-03 02:47:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18927 to 18754. [2019-10-03 02:47:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18754 states. [2019-10-03 02:47:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18754 states to 18754 states and 30516 transitions. [2019-10-03 02:47:13,937 INFO L78 Accepts]: Start accepts. Automaton has 18754 states and 30516 transitions. Word has length 155 [2019-10-03 02:47:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:13,937 INFO L475 AbstractCegarLoop]: Abstraction has 18754 states and 30516 transitions. [2019-10-03 02:47:13,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 18754 states and 30516 transitions. [2019-10-03 02:47:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-03 02:47:13,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:13,943 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:13,943 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:13,944 INFO L82 PathProgramCache]: Analyzing trace with hash 546174349, now seen corresponding path program 1 times [2019-10-03 02:47:13,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:13,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:13,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:13,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:13,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:47:14,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:14,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:14,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:14,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:14,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:14,095 INFO L87 Difference]: Start difference. First operand 18754 states and 30516 transitions. Second operand 10 states. [2019-10-03 02:47:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:20,700 INFO L93 Difference]: Finished difference Result 42074 states and 70262 transitions. [2019-10-03 02:47:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:20,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-10-03 02:47:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:20,971 INFO L225 Difference]: With dead ends: 42074 [2019-10-03 02:47:20,971 INFO L226 Difference]: Without dead ends: 42074 [2019-10-03 02:47:20,972 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42074 states. [2019-10-03 02:47:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42074 to 41747. [2019-10-03 02:47:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41747 states. [2019-10-03 02:47:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41747 states to 41747 states and 69296 transitions. [2019-10-03 02:47:22,505 INFO L78 Accepts]: Start accepts. Automaton has 41747 states and 69296 transitions. Word has length 154 [2019-10-03 02:47:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:22,506 INFO L475 AbstractCegarLoop]: Abstraction has 41747 states and 69296 transitions. [2019-10-03 02:47:22,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 41747 states and 69296 transitions. [2019-10-03 02:47:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:47:22,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:22,512 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:22,512 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:22,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:22,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1692075242, now seen corresponding path program 1 times [2019-10-03 02:47:22,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:22,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:22,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:22,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:22,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:47:22,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:22,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:22,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:22,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:22,680 INFO L87 Difference]: Start difference. First operand 41747 states and 69296 transitions. Second operand 10 states. [2019-10-03 02:47:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:30,866 INFO L93 Difference]: Finished difference Result 96484 states and 166269 transitions. [2019-10-03 02:47:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:30,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2019-10-03 02:47:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:31,410 INFO L225 Difference]: With dead ends: 96484 [2019-10-03 02:47:31,411 INFO L226 Difference]: Without dead ends: 96484 [2019-10-03 02:47:31,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96484 states. [2019-10-03 02:47:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96484 to 95849. [2019-10-03 02:47:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95849 states. [2019-10-03 02:47:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95849 states to 95849 states and 163719 transitions. [2019-10-03 02:47:34,024 INFO L78 Accepts]: Start accepts. Automaton has 95849 states and 163719 transitions. Word has length 157 [2019-10-03 02:47:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:34,025 INFO L475 AbstractCegarLoop]: Abstraction has 95849 states and 163719 transitions. [2019-10-03 02:47:34,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 95849 states and 163719 transitions. [2019-10-03 02:47:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-03 02:47:34,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:34,031 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:34,032 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1188270993, now seen corresponding path program 1 times [2019-10-03 02:47:34,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:34,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:34,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:47:34,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:34,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:34,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:34,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:34,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:34,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:34,175 INFO L87 Difference]: Start difference. First operand 95849 states and 163719 transitions. Second operand 10 states. [2019-10-03 02:47:44,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:44,323 INFO L93 Difference]: Finished difference Result 229611 states and 414085 transitions. [2019-10-03 02:47:44,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:44,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-10-03 02:47:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:46,115 INFO L225 Difference]: With dead ends: 229611 [2019-10-03 02:47:46,115 INFO L226 Difference]: Without dead ends: 229611 [2019-10-03 02:47:46,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229611 states. [2019-10-03 02:47:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229611 to 228360. [2019-10-03 02:47:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228360 states. [2019-10-03 02:47:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228360 states to 228360 states and 406447 transitions. [2019-10-03 02:47:59,434 INFO L78 Accepts]: Start accepts. Automaton has 228360 states and 406447 transitions. Word has length 156 [2019-10-03 02:47:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:59,434 INFO L475 AbstractCegarLoop]: Abstraction has 228360 states and 406447 transitions. [2019-10-03 02:47:59,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 228360 states and 406447 transitions. [2019-10-03 02:47:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-03 02:47:59,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:59,446 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:59,446 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 86898095, now seen corresponding path program 1 times [2019-10-03 02:47:59,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:47:59,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:59,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:59,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:59,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:59,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:59,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:59,572 INFO L87 Difference]: Start difference. First operand 228360 states and 406447 transitions. Second operand 3 states. [2019-10-03 02:48:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:13,057 INFO L93 Difference]: Finished difference Result 456643 states and 871555 transitions. [2019-10-03 02:48:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:13,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-03 02:48:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:16,604 INFO L225 Difference]: With dead ends: 456643 [2019-10-03 02:48:16,605 INFO L226 Difference]: Without dead ends: 456643 [2019-10-03 02:48:16,605 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456643 states. [2019-10-03 02:48:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456643 to 456641. [2019-10-03 02:48:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456641 states. [2019-10-03 02:49:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456641 states to 456641 states and 871554 transitions. [2019-10-03 02:49:01,889 INFO L78 Accepts]: Start accepts. Automaton has 456641 states and 871554 transitions. Word has length 159 [2019-10-03 02:49:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:01,889 INFO L475 AbstractCegarLoop]: Abstraction has 456641 states and 871554 transitions. [2019-10-03 02:49:01,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 456641 states and 871554 transitions. [2019-10-03 02:49:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:49:01,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:01,899 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:01,899 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash -613818356, now seen corresponding path program 1 times [2019-10-03 02:49:01,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:01,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:01,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:49:02,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:02,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:02,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:02,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:02,010 INFO L87 Difference]: Start difference. First operand 456641 states and 871554 transitions. Second operand 3 states. [2019-10-03 02:49:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:34,782 INFO L93 Difference]: Finished difference Result 913207 states and 1932477 transitions. [2019-10-03 02:49:34,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:49:34,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-03 02:49:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:53,895 INFO L225 Difference]: With dead ends: 913207 [2019-10-03 02:49:53,895 INFO L226 Difference]: Without dead ends: 913207 [2019-10-03 02:49:53,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913207 states.