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_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:46:39,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:46:39,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:46:39,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:46:39,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:46:39,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:46:39,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:46:39,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:46:39,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:46:39,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:46:39,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:46:39,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:46:39,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:46:39,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:46:39,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:46:39,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:46:39,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:46:39,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:46:39,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:46:39,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:46:39,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:46:39,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:46:39,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:46:39,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:46:39,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:46:39,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:46:39,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:46:39,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:46:39,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:46:39,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:46:39,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:46:39,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:46:39,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:46:39,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:46:39,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:46:39,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:46:39,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:46:39,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:46:39,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:46:39,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:46:39,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:46:39,387 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:39,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:46:39,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:46:39,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:46:39,415 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:46:39,416 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:46:39,416 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:46:39,417 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:46:39,417 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:46:39,417 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:46:39,417 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:46:39,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:46:39,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:46:39,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:46:39,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:46:39,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:46:39,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:46:39,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:46:39,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:46:39,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:46:39,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:46:39,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:46:39,423 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:46:39,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:46:39,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:46:39,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:46:39,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:46:39,424 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:46:39,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:46:39,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:46:39,425 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:46:39,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:46:39,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:46:39,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:46:39,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:46:39,493 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:46:39,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product30.cil.c [2019-10-03 02:46:39,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da5605fd/2c4f0274be9a49a6988a8fd54244bb54/FLAG9e9164b2b [2019-10-03 02:46:40,227 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:46:40,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product30.cil.c [2019-10-03 02:46:40,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da5605fd/2c4f0274be9a49a6988a8fd54244bb54/FLAG9e9164b2b [2019-10-03 02:46:40,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da5605fd/2c4f0274be9a49a6988a8fd54244bb54 [2019-10-03 02:46:40,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:46:40,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:46:40,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:46:40,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:46:40,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:46:40,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:46:40" (1/1) ... [2019-10-03 02:46:40,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5d2151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:40, skipping insertion in model container [2019-10-03 02:46:40,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:46:40" (1/1) ... [2019-10-03 02:46:40,427 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:46:40,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:46:41,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:46:41,453 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:46:41,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:46:41,701 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:46:41,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:41 WrapperNode [2019-10-03 02:46:41,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:46:41,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:46:41,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:46:41,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:46:41,719 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:41" (1/1) ... [2019-10-03 02:46:41,720 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:41" (1/1) ... [2019-10-03 02:46:41,756 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:41" (1/1) ... [2019-10-03 02:46:41,757 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:41" (1/1) ... [2019-10-03 02:46:41,822 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:41" (1/1) ... [2019-10-03 02:46:41,868 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:41" (1/1) ... [2019-10-03 02:46:41,897 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:41" (1/1) ... [2019-10-03 02:46:41,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:46:41,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:46:41,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:46:41,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:46:41,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:41" (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:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:46:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:46:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:46:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:46:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:46:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:46:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:46:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:46:42,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:46:42,022 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:46:42,022 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:46:42,023 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:46:42,023 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:46:42,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:46:42,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:46:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:46:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:46:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:46:42,025 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:46:42,025 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:46:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:46:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:46:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:46:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:46:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:46:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:46:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:46:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:46:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:46:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:46:42,028 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:46:42,028 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:46:42,028 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:46:42,028 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:46:42,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:46:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:46:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:46:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:46:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:46:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:46:42,030 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:46:42,030 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:46:42,030 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:46:42,030 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:46:42,030 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:46:42,031 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:46:42,031 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:46:42,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:46:42,032 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:46:42,032 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-03 02:46:42,032 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:46:42,032 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-03 02:46:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:46:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:46:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:46:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:46:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:46:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:46:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:46:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:46:42,035 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:46:42,035 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:46:42,035 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:46:42,036 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:46:42,036 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:46:42,036 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:46:42,036 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:46:42,036 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:46:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:46:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:46:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:46:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:46:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:46:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:46:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:46:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:46:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:46:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:46:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:46:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:46:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:46:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:46:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:46:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:46:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:46:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:46:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:46:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:46:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:46:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:46:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:46:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:46:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:46:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:46:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:46:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:46:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:46:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:46:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:46:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:46:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:46:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:46:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:46:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:46:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:46:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:46:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:46:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:46:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:46:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:46:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:46:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:46:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:46:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:46:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:46:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:46:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:46:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:46:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:46:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:46:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:46:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:46:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:46:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:46:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:46:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:46:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:46:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:46:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:46:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:46:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:46:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:46:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:46:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:46:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:46:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:46:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:46:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:46:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:46:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:46:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:46:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:46:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:46:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:46:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:46:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:46:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:46:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:46:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:46:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:46:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-03 02:46:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-03 02:46:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:46:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:46:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:46:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:46:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:46:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:46:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:46:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:46:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:46:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:46:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:46:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:46:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:46:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:46:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:46:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:46:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:46:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:46:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:46:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:46:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:46:45,059 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:46:45,059 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:46:45,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:46:45 BoogieIcfgContainer [2019-10-03 02:46:45,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:46:45,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:46:45,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:46:45,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:46:45,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:46:40" (1/3) ... [2019-10-03 02:46:45,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b8a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:46:45, skipping insertion in model container [2019-10-03 02:46:45,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:41" (2/3) ... [2019-10-03 02:46:45,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b8a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:46:45, skipping insertion in model container [2019-10-03 02:46:45,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:46:45" (3/3) ... [2019-10-03 02:46:45,071 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2019-10-03 02:46:45,083 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:46:45,097 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:46:45,117 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:46:45,150 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:46:45,151 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:46:45,151 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:46:45,151 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:46:45,151 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:46:45,151 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:46:45,151 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:46:45,152 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:46:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states. [2019-10-03 02:46:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:46:45,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:45,236 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] [2019-10-03 02:46:45,239 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash 236945449, now seen corresponding path program 1 times [2019-10-03 02:46:45,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:45,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:45,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:45,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:45,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:45,886 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,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:45,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:45,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:45,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:45,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:45,960 INFO L87 Difference]: Start difference. First operand 796 states. Second operand 4 states. [2019-10-03 02:46:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:46,184 INFO L93 Difference]: Finished difference Result 640 states and 1013 transitions. [2019-10-03 02:46:46,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:46,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-03 02:46:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:46,237 INFO L225 Difference]: With dead ends: 640 [2019-10-03 02:46:46,237 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:46:46,241 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:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:46:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:46:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:46:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1001 transitions. [2019-10-03 02:46:46,359 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1001 transitions. Word has length 87 [2019-10-03 02:46:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:46,359 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1001 transitions. [2019-10-03 02:46:46,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1001 transitions. [2019-10-03 02:46:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:46:46,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:46,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:46,366 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:46,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash -217065445, now seen corresponding path program 1 times [2019-10-03 02:46:46,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:46,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:46,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:46,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:46,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:46,592 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:46,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:46,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:46,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:46,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:46,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:46,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:46,595 INFO L87 Difference]: Start difference. First operand 629 states and 1001 transitions. Second operand 4 states. [2019-10-03 02:46:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:46,661 INFO L93 Difference]: Finished difference Result 631 states and 1002 transitions. [2019-10-03 02:46:46,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:46,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-03 02:46:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:46,669 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:46:46,669 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:46:46,670 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:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:46:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:46:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:46:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1000 transitions. [2019-10-03 02:46:46,709 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1000 transitions. Word has length 90 [2019-10-03 02:46:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:46,709 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1000 transitions. [2019-10-03 02:46:46,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1000 transitions. [2019-10-03 02:46:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:46:46,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:46,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:46,714 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1176241356, now seen corresponding path program 1 times [2019-10-03 02:46:46,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:46,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:46,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:46,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:46,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:46,866 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:46,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:46,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:46,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:46,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:46,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:46,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:46,868 INFO L87 Difference]: Start difference. First operand 629 states and 1000 transitions. Second operand 4 states. [2019-10-03 02:46:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:46,926 INFO L93 Difference]: Finished difference Result 631 states and 1001 transitions. [2019-10-03 02:46:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:46,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:46:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:46,933 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:46:46,933 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:46:46,934 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:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:46:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:46:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:46:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 999 transitions. [2019-10-03 02:46:46,963 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 999 transitions. Word has length 91 [2019-10-03 02:46:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:46,964 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 999 transitions. [2019-10-03 02:46:46,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 999 transitions. [2019-10-03 02:46:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:46:46,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:46,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:46,967 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:46,967 INFO L82 PathProgramCache]: Analyzing trace with hash 21534647, now seen corresponding path program 1 times [2019-10-03 02:46:46,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:46,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:46,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:46,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:47,204 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:47,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:47,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:47,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:47,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:47,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:47,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:47,207 INFO L87 Difference]: Start difference. First operand 629 states and 999 transitions. Second operand 4 states. [2019-10-03 02:46:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:47,277 INFO L93 Difference]: Finished difference Result 631 states and 1000 transitions. [2019-10-03 02:46:47,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:47,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:46:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:47,286 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:46:47,286 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:46:47,287 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:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:46:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:46:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:46:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 998 transitions. [2019-10-03 02:46:47,318 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 998 transitions. Word has length 92 [2019-10-03 02:46:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:47,320 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 998 transitions. [2019-10-03 02:46:47,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 998 transitions. [2019-10-03 02:46:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:46:47,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:47,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:47,330 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -634656752, now seen corresponding path program 1 times [2019-10-03 02:46:47,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:47,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:47,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:47,500 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:47,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:47,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:47,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:47,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:47,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:47,503 INFO L87 Difference]: Start difference. First operand 629 states and 998 transitions. Second operand 4 states. [2019-10-03 02:46:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:47,558 INFO L93 Difference]: Finished difference Result 631 states and 999 transitions. [2019-10-03 02:46:47,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:47,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-03 02:46:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:47,564 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:46:47,565 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:46:47,565 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:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:46:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:46:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:46:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 997 transitions. [2019-10-03 02:46:47,590 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 997 transitions. Word has length 93 [2019-10-03 02:46:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:47,591 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 997 transitions. [2019-10-03 02:46:47,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 997 transitions. [2019-10-03 02:46:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:46:47,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:47,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:47,594 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1365704531, now seen corresponding path program 1 times [2019-10-03 02:46:47,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:47,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:47,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:47,852 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:47,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:47,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:47,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:47,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:47,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:47,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:47,863 INFO L87 Difference]: Start difference. First operand 629 states and 997 transitions. Second operand 10 states. [2019-10-03 02:46:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:48,040 INFO L93 Difference]: Finished difference Result 638 states and 1008 transitions. [2019-10-03 02:46:48,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:46:48,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-03 02:46:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:48,047 INFO L225 Difference]: With dead ends: 638 [2019-10-03 02:46:48,047 INFO L226 Difference]: Without dead ends: 638 [2019-10-03 02:46:48,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:46:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-03 02:46:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-03 02:46:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-03 02:46:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1006 transitions. [2019-10-03 02:46:48,076 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1006 transitions. Word has length 94 [2019-10-03 02:46:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:48,077 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1006 transitions. [2019-10-03 02:46:48,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:46:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1006 transitions. [2019-10-03 02:46:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:46:48,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:48,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:48,081 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:48,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash -564914574, now seen corresponding path program 1 times [2019-10-03 02:46:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:48,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:48,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:48,205 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:48,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:48,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:48,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:48,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:48,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:48,207 INFO L87 Difference]: Start difference. First operand 636 states and 1006 transitions. Second operand 4 states. [2019-10-03 02:46:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:48,315 INFO L93 Difference]: Finished difference Result 634 states and 1001 transitions. [2019-10-03 02:46:48,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:48,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-03 02:46:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:48,324 INFO L225 Difference]: With dead ends: 634 [2019-10-03 02:46:48,324 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:46:48,324 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:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:46:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:46:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:46:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 983 transitions. [2019-10-03 02:46:48,349 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 983 transitions. Word has length 94 [2019-10-03 02:46:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:48,349 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 983 transitions. [2019-10-03 02:46:48,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:48,349 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 983 transitions. [2019-10-03 02:46:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:46:48,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:48,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:48,353 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash -811237728, now seen corresponding path program 1 times [2019-10-03 02:46:48,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:48,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:48,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:48,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:48,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:48,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:48,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:48,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:48,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:48,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:48,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:48,525 INFO L87 Difference]: Start difference. First operand 623 states and 983 transitions. Second operand 6 states. [2019-10-03 02:46:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:48,800 INFO L93 Difference]: Finished difference Result 626 states and 986 transitions. [2019-10-03 02:46:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:48,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 02:46:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:48,806 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:46:48,807 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:46:48,807 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:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:46:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:46:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:46:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 979 transitions. [2019-10-03 02:46:48,831 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 979 transitions. Word has length 95 [2019-10-03 02:46:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:48,831 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 979 transitions. [2019-10-03 02:46:48,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 979 transitions. [2019-10-03 02:46:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:46:48,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:48,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:48,834 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:48,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1457329514, now seen corresponding path program 1 times [2019-10-03 02:46:48,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:48,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:48,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:48,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:48,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:49,004 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:49,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:49,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:49,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:49,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:49,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:49,006 INFO L87 Difference]: Start difference. First operand 623 states and 979 transitions. Second operand 6 states. [2019-10-03 02:46:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:49,250 INFO L93 Difference]: Finished difference Result 626 states and 982 transitions. [2019-10-03 02:46:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:49,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:46:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:49,257 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:46:49,257 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:46:49,258 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:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:46:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:46:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:46:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 975 transitions. [2019-10-03 02:46:49,280 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 975 transitions. Word has length 96 [2019-10-03 02:46:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:49,280 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 975 transitions. [2019-10-03 02:46:49,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 975 transitions. [2019-10-03 02:46:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:46:49,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:49,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:49,283 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1359647269, now seen corresponding path program 1 times [2019-10-03 02:46:49,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:49,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:49,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:49,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:49,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:49,478 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:49,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:49,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:49,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:49,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:49,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:49,480 INFO L87 Difference]: Start difference. First operand 623 states and 975 transitions. Second operand 6 states. [2019-10-03 02:46:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:49,713 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2019-10-03 02:46:49,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:49,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-03 02:46:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:49,719 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:46:49,719 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:46:49,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:46:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:46:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:46:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 971 transitions. [2019-10-03 02:46:49,740 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 971 transitions. Word has length 97 [2019-10-03 02:46:49,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:49,741 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 971 transitions. [2019-10-03 02:46:49,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 971 transitions. [2019-10-03 02:46:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:46:49,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:49,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:49,743 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash -969773403, now seen corresponding path program 1 times [2019-10-03 02:46:49,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:49,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:49,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:49,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:49,885 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:49,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:49,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:49,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:49,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:49,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:49,888 INFO L87 Difference]: Start difference. First operand 623 states and 971 transitions. Second operand 7 states. [2019-10-03 02:46:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:49,997 INFO L93 Difference]: Finished difference Result 626 states and 974 transitions. [2019-10-03 02:46:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:49,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-03 02:46:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:50,006 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:46:50,007 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:46:50,008 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:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:46:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-03 02:46:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-03 02:46:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 937 transitions. [2019-10-03 02:46:50,052 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 937 transitions. Word has length 97 [2019-10-03 02:46:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:50,053 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 937 transitions. [2019-10-03 02:46:50,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 937 transitions. [2019-10-03 02:46:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:46:50,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:50,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:50,056 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash -137400005, now seen corresponding path program 1 times [2019-10-03 02:46:50,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:50,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:50,246 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:50,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:50,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:50,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:50,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:50,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:50,250 INFO L87 Difference]: Start difference. First operand 602 states and 937 transitions. Second operand 6 states. [2019-10-03 02:46:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:50,388 INFO L93 Difference]: Finished difference Result 605 states and 940 transitions. [2019-10-03 02:46:50,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:50,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-03 02:46:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:50,394 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:46:50,394 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:46:50,395 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:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:46:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-03 02:46:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-03 02:46:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 936 transitions. [2019-10-03 02:46:50,418 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 936 transitions. Word has length 98 [2019-10-03 02:46:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:50,419 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 936 transitions. [2019-10-03 02:46:50,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 936 transitions. [2019-10-03 02:46:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:46:50,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:50,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:50,422 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:50,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:50,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2069760426, now seen corresponding path program 1 times [2019-10-03 02:46:50,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:50,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:50,572 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:50,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:50,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:50,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:50,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:50,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:50,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:50,576 INFO L87 Difference]: Start difference. First operand 602 states and 936 transitions. Second operand 6 states. [2019-10-03 02:46:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:50,698 INFO L93 Difference]: Finished difference Result 605 states and 939 transitions. [2019-10-03 02:46:50,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:50,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-03 02:46:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:50,706 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:46:50,707 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:46:50,707 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:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:46:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-03 02:46:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-03 02:46:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 935 transitions. [2019-10-03 02:46:50,747 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 935 transitions. Word has length 99 [2019-10-03 02:46:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:50,747 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 935 transitions. [2019-10-03 02:46:50,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 935 transitions. [2019-10-03 02:46:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 02:46:50,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:50,751 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] [2019-10-03 02:46:50,751 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1151724576, now seen corresponding path program 1 times [2019-10-03 02:46:50,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:50,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:50,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:51,038 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:51,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:51,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:46:51,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:51,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:46:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:46:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:46:51,040 INFO L87 Difference]: Start difference. First operand 602 states and 935 transitions. Second operand 12 states. [2019-10-03 02:46:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:51,235 INFO L93 Difference]: Finished difference Result 606 states and 938 transitions. [2019-10-03 02:46:51,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:46:51,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-03 02:46:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:51,241 INFO L225 Difference]: With dead ends: 606 [2019-10-03 02:46:51,242 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:46:51,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:46:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-03 02:46:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-03 02:46:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 934 transitions. [2019-10-03 02:46:51,265 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 934 transitions. Word has length 100 [2019-10-03 02:46:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:51,265 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 934 transitions. [2019-10-03 02:46:51,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:46:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 934 transitions. [2019-10-03 02:46:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:46:51,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:51,268 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] [2019-10-03 02:46:51,268 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash 196339579, now seen corresponding path program 1 times [2019-10-03 02:46:51,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:51,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:51,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:51,451 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:51,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:51,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:51,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:51,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:51,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:51,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:51,453 INFO L87 Difference]: Start difference. First operand 602 states and 934 transitions. Second operand 10 states. [2019-10-03 02:46:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:59,294 INFO L93 Difference]: Finished difference Result 1240 states and 1967 transitions. [2019-10-03 02:46:59,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:46:59,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-10-03 02:46:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:59,306 INFO L225 Difference]: With dead ends: 1240 [2019-10-03 02:46:59,306 INFO L226 Difference]: Without dead ends: 1240 [2019-10-03 02:46:59,306 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:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-10-03 02:46:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1210. [2019-10-03 02:46:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-03 02:46:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1927 transitions. [2019-10-03 02:46:59,353 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1927 transitions. Word has length 101 [2019-10-03 02:46:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:59,353 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1927 transitions. [2019-10-03 02:46:59,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:46:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1927 transitions. [2019-10-03 02:46:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 02:46:59,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:59,356 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] [2019-10-03 02:46:59,356 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash 994116260, now seen corresponding path program 1 times [2019-10-03 02:46:59,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:59,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:59,555 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:59,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:59,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:59,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:59,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:59,561 INFO L87 Difference]: Start difference. First operand 1210 states and 1927 transitions. Second operand 10 states. [2019-10-03 02:47:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:07,186 INFO L93 Difference]: Finished difference Result 2629 states and 4271 transitions. [2019-10-03 02:47:07,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:07,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-10-03 02:47:07,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:07,207 INFO L225 Difference]: With dead ends: 2629 [2019-10-03 02:47:07,207 INFO L226 Difference]: Without dead ends: 2629 [2019-10-03 02:47:07,208 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:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-10-03 02:47:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2588. [2019-10-03 02:47:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-10-03 02:47:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 4209 transitions. [2019-10-03 02:47:07,298 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 4209 transitions. Word has length 102 [2019-10-03 02:47:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:07,299 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 4209 transitions. [2019-10-03 02:47:07,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 4209 transitions. [2019-10-03 02:47:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:47:07,301 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:07,301 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] [2019-10-03 02:47:07,301 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash 800793247, now seen corresponding path program 1 times [2019-10-03 02:47:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:07,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:07,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:07,453 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:47:07,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:07,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:07,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:07,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:07,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:07,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:07,455 INFO L87 Difference]: Start difference. First operand 2588 states and 4209 transitions. Second operand 10 states. [2019-10-03 02:47:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:14,660 INFO L93 Difference]: Finished difference Result 5871 states and 9765 transitions. [2019-10-03 02:47:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:14,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-10-03 02:47:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:14,709 INFO L225 Difference]: With dead ends: 5871 [2019-10-03 02:47:14,710 INFO L226 Difference]: Without dead ends: 5871 [2019-10-03 02:47:14,710 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:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2019-10-03 02:47:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5808. [2019-10-03 02:47:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5808 states. [2019-10-03 02:47:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 9647 transitions. [2019-10-03 02:47:14,971 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 9647 transitions. Word has length 103 [2019-10-03 02:47:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:14,972 INFO L475 AbstractCegarLoop]: Abstraction has 5808 states and 9647 transitions. [2019-10-03 02:47:14,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 9647 transitions. [2019-10-03 02:47:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 02:47:14,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:14,975 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] [2019-10-03 02:47:14,976 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:14,976 INFO L82 PathProgramCache]: Analyzing trace with hash -51849208, now seen corresponding path program 1 times [2019-10-03 02:47:14,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:14,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:14,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:15,193 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:47:15,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:15,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:15,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:15,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:15,196 INFO L87 Difference]: Start difference. First operand 5808 states and 9647 transitions. Second operand 10 states. [2019-10-03 02:47:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:23,117 INFO L93 Difference]: Finished difference Result 13738 states and 23496 transitions. [2019-10-03 02:47:23,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:23,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-10-03 02:47:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:23,247 INFO L225 Difference]: With dead ends: 13738 [2019-10-03 02:47:23,248 INFO L226 Difference]: Without dead ends: 13738 [2019-10-03 02:47:23,249 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:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states. [2019-10-03 02:47:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 13631. [2019-10-03 02:47:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13631 states. [2019-10-03 02:47:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13631 states to 13631 states and 23218 transitions. [2019-10-03 02:47:23,830 INFO L78 Accepts]: Start accepts. Automaton has 13631 states and 23218 transitions. Word has length 104 [2019-10-03 02:47:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:23,831 INFO L475 AbstractCegarLoop]: Abstraction has 13631 states and 23218 transitions. [2019-10-03 02:47:23,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13631 states and 23218 transitions. [2019-10-03 02:47:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 02:47:23,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:23,833 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] [2019-10-03 02:47:23,833 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:23,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 131442115, now seen corresponding path program 1 times [2019-10-03 02:47:23,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:23,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:23,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:24,022 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:47:24,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:24,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:24,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:24,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:24,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:24,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:24,026 INFO L87 Difference]: Start difference. First operand 13631 states and 23218 transitions. Second operand 10 states. [2019-10-03 02:47:24,635 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-10-03 02:47:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:31,950 INFO L93 Difference]: Finished difference Result 33776 states and 59914 transitions. [2019-10-03 02:47:31,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:31,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-03 02:47:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:32,287 INFO L225 Difference]: With dead ends: 33776 [2019-10-03 02:47:32,287 INFO L226 Difference]: Without dead ends: 33776 [2019-10-03 02:47:32,289 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33776 states. [2019-10-03 02:47:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33776 to 33581. [2019-10-03 02:47:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33581 states. [2019-10-03 02:47:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33581 states to 33581 states and 59124 transitions. [2019-10-03 02:47:34,777 INFO L78 Accepts]: Start accepts. Automaton has 33581 states and 59124 transitions. Word has length 105 [2019-10-03 02:47:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:34,779 INFO L475 AbstractCegarLoop]: Abstraction has 33581 states and 59124 transitions. [2019-10-03 02:47:34,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33581 states and 59124 transitions. [2019-10-03 02:47:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 02:47:34,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:34,781 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] [2019-10-03 02:47:34,781 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:34,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1931057812, now seen corresponding path program 1 times [2019-10-03 02:47:34,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:34,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:34,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:34,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:34,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:34,964 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:47:34,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:34,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:34,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:34,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:34,967 INFO L87 Difference]: Start difference. First operand 33581 states and 59124 transitions. Second operand 10 states. [2019-10-03 02:47:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:44,856 INFO L93 Difference]: Finished difference Result 87855 states and 163839 transitions. [2019-10-03 02:47:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:44,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-03 02:47:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:45,681 INFO L225 Difference]: With dead ends: 87855 [2019-10-03 02:47:45,681 INFO L226 Difference]: Without dead ends: 87855 [2019-10-03 02:47:45,682 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:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87855 states. [2019-10-03 02:47:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87855 to 87484. [2019-10-03 02:47:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87484 states. [2019-10-03 02:47:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87484 states to 87484 states and 161257 transitions. [2019-10-03 02:47:53,008 INFO L78 Accepts]: Start accepts. Automaton has 87484 states and 161257 transitions. Word has length 106 [2019-10-03 02:47:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:53,009 INFO L475 AbstractCegarLoop]: Abstraction has 87484 states and 161257 transitions. [2019-10-03 02:47:53,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 87484 states and 161257 transitions. [2019-10-03 02:47:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 02:47:53,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:53,011 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] [2019-10-03 02:47:53,011 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1719706899, now seen corresponding path program 1 times [2019-10-03 02:47:53,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:53,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:53,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:53,113 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:47:53,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:53,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:53,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:53,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:53,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:53,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:53,115 INFO L87 Difference]: Start difference. First operand 87484 states and 161257 transitions. Second operand 3 states. [2019-10-03 02:47:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:58,814 INFO L93 Difference]: Finished difference Result 174893 states and 361451 transitions. [2019-10-03 02:47:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:58,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-03 02:47:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:00,248 INFO L225 Difference]: With dead ends: 174893 [2019-10-03 02:48:00,248 INFO L226 Difference]: Without dead ends: 174893 [2019-10-03 02:48:00,249 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:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174893 states. [2019-10-03 02:48:06,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174893 to 174891. [2019-10-03 02:48:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174891 states. [2019-10-03 02:48:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174891 states to 174891 states and 361450 transitions. [2019-10-03 02:48:16,334 INFO L78 Accepts]: Start accepts. Automaton has 174891 states and 361450 transitions. Word has length 106 [2019-10-03 02:48:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:16,334 INFO L475 AbstractCegarLoop]: Abstraction has 174891 states and 361450 transitions. [2019-10-03 02:48:16,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 174891 states and 361450 transitions. [2019-10-03 02:48:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 02:48:16,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:16,337 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] [2019-10-03 02:48:16,337 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:16,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1772620946, now seen corresponding path program 1 times [2019-10-03 02:48:16,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:16,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:16,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:16,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:16,440 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:48:16,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:16,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:16,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:16,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:16,442 INFO L87 Difference]: Start difference. First operand 174891 states and 361450 transitions. Second operand 3 states. [2019-10-03 02:48:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:31,157 INFO L93 Difference]: Finished difference Result 349709 states and 845158 transitions. [2019-10-03 02:48:31,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:31,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-03 02:48:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:34,874 INFO L225 Difference]: With dead ends: 349709 [2019-10-03 02:48:34,874 INFO L226 Difference]: Without dead ends: 349709 [2019-10-03 02:48:34,874 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:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349709 states. [2019-10-03 02:49:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349709 to 349706. [2019-10-03 02:49:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349706 states. [2019-10-03 02:49:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349706 states to 349706 states and 845156 transitions. [2019-10-03 02:49:23,651 INFO L78 Accepts]: Start accepts. Automaton has 349706 states and 845156 transitions. Word has length 107 [2019-10-03 02:49:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:23,651 INFO L475 AbstractCegarLoop]: Abstraction has 349706 states and 845156 transitions. [2019-10-03 02:49:23,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 349706 states and 845156 transitions. [2019-10-03 02:49:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 02:49:23,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:23,653 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] [2019-10-03 02:49:23,653 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:23,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:23,654 INFO L82 PathProgramCache]: Analyzing trace with hash 882014799, now seen corresponding path program 1 times [2019-10-03 02:49:23,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:23,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:23,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:23,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:23,764 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:49:23,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:23,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:23,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:23,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:23,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:23,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:23,766 INFO L87 Difference]: Start difference. First operand 349706 states and 845156 transitions. Second operand 3 states. [2019-10-03 02:50:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:13,688 INFO L93 Difference]: Finished difference Result 699341 states and 2084187 transitions. [2019-10-03 02:50:13,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:13,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-03 02:50:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:23,023 INFO L225 Difference]: With dead ends: 699341 [2019-10-03 02:50:23,023 INFO L226 Difference]: Without dead ends: 699341 [2019-10-03 02:50:23,024 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:50:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699341 states.