java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:31:22,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:31:22,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:31:22,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:31:22,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:31:22,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:31:22,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:31:22,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:31:22,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:31:22,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:31:22,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:31:22,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:31:22,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:31:22,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:31:22,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:31:22,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:31:22,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:31:22,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:31:22,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:31:22,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:31:22,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:31:22,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:31:22,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:31:22,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:31:22,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:31:22,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:31:22,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:31:22,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:31:22,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:31:22,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:31:22,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:31:22,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:31:22,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:31:22,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:31:22,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:31:22,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:31:22,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:31:22,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:31:22,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:31:22,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:31:22,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:31:22,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:31:22,273 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:31:22,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:31:22,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:31:22,274 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:31:22,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:31:22,274 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:31:22,274 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:31:22,275 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:31:22,275 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:31:22,275 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:31:22,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:31:22,276 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:31:22,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:31:22,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:31:22,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:31:22,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:31:22,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:31:22,277 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:31:22,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:31:22,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:31:22,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:31:22,278 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:31:22,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:31:22,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:22,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:31:22,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:31:22,279 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:31:22,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:31:22,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:31:22,279 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:31:22,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:31:22,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:31:22,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:31:22,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:31:22,324 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:31:22,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-09-10 02:31:22,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b350fba5/21771f6a881b464a8e780ed2b4e051ea/FLAG99701124b [2019-09-10 02:31:23,030 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:31:23,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-09-10 02:31:23,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b350fba5/21771f6a881b464a8e780ed2b4e051ea/FLAG99701124b [2019-09-10 02:31:23,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b350fba5/21771f6a881b464a8e780ed2b4e051ea [2019-09-10 02:31:23,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:31:23,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:31:23,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:23,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:31:23,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:31:23,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:23" (1/1) ... [2019-09-10 02:31:23,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357a5375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:23, skipping insertion in model container [2019-09-10 02:31:23,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:23" (1/1) ... [2019-09-10 02:31:23,209 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:31:23,276 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:31:24,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:24,027 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:31:24,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:24,224 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:31:24,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24 WrapperNode [2019-09-10 02:31:24,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:24,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:31:24,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:31:24,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:31:24,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:31:24,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:31:24,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:31:24,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:31:24,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:31:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:31:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:31:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:31:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:31:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:31:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:31:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:31:24,487 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:31:24,487 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:31:24,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:31:24,487 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:31:24,488 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:31:24,488 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:31:24,488 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:31:24,488 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:31:24,488 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:31:24,489 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:31:24,489 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:31:24,489 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:31:24,489 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:31:24,489 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:31:24,489 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:31:24,490 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:31:24,490 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:31:24,490 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:31:24,490 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:31:24,490 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:31:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:31:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:31:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:31:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:31:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:31:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:31:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:31:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:31:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:31:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:31:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:31:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:31:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:31:24,493 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:31:24,493 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:31:24,493 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:31:24,493 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:31:24,493 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:31:24,493 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:31:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:31:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:31:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:31:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:31:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:31:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:31:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:31:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:31:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:31:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:31:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:31:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:31:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:31:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:31:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:31:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:31:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:31:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:31:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:31:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:31:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:31:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:31:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:31:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:31:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:31:24,499 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:31:24,499 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:31:24,499 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:31:24,499 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:31:24,499 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:31:24,499 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:31:24,499 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:31:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:31:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:31:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:31:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:31:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:31:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:31:24,500 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:31:24,501 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:31:24,501 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:31:24,501 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:31:24,501 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:31:24,501 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:31:24,501 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:31:24,501 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:31:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:31:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:31:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:31:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:31:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:31:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:31:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:31:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:31:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:31:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:31:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:31:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:31:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:31:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:31:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:31:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:31:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:31:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:31:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:31:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:31:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:31:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:31:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:31:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:31:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:31:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:31:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:31:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:31:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:31:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:31:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:31:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:31:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:31:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:31:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:31:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:31:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:31:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:31:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:31:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:31:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:31:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:31:26,876 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:31:26,877 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:31:26,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:26 BoogieIcfgContainer [2019-09-10 02:31:26,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:31:26,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:31:26,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:31:26,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:31:26,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:31:23" (1/3) ... [2019-09-10 02:31:26,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d35e880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:26, skipping insertion in model container [2019-09-10 02:31:26,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24" (2/3) ... [2019-09-10 02:31:26,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d35e880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:26, skipping insertion in model container [2019-09-10 02:31:26,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:26" (3/3) ... [2019-09-10 02:31:26,887 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2019-09-10 02:31:26,896 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:31:26,907 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:31:26,924 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:31:26,962 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:31:26,962 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:31:26,962 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:31:26,962 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:31:26,962 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:31:26,962 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:31:26,962 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:31:26,963 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:31:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states. [2019-09-10 02:31:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 02:31:27,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:27,043 INFO L399 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-09-10 02:31:27,046 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1835526368, now seen corresponding path program 1 times [2019-09-10 02:31:27,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:27,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:27,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:27,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:27,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:27,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:27,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:27,655 INFO L87 Difference]: Start difference. First operand 742 states. Second operand 4 states. [2019-09-10 02:31:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:27,839 INFO L93 Difference]: Finished difference Result 593 states and 949 transitions. [2019-09-10 02:31:27,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:27,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 02:31:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:27,881 INFO L225 Difference]: With dead ends: 593 [2019-09-10 02:31:27,881 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 02:31:27,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 02:31:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-10 02:31:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-10 02:31:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 937 transitions. [2019-09-10 02:31:27,992 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 937 transitions. Word has length 107 [2019-09-10 02:31:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:27,992 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 937 transitions. [2019-09-10 02:31:27,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 937 transitions. [2019-09-10 02:31:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 02:31:28,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:28,001 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash 443776321, now seen corresponding path program 1 times [2019-09-10 02:31:28,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:28,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:28,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:28,240 INFO L87 Difference]: Start difference. First operand 582 states and 937 transitions. Second operand 4 states. [2019-09-10 02:31:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:28,305 INFO L93 Difference]: Finished difference Result 584 states and 938 transitions. [2019-09-10 02:31:28,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:28,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 02:31:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:28,311 INFO L225 Difference]: With dead ends: 584 [2019-09-10 02:31:28,312 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 02:31:28,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 02:31:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-10 02:31:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-10 02:31:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 936 transitions. [2019-09-10 02:31:28,338 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 936 transitions. Word has length 110 [2019-09-10 02:31:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:28,338 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 936 transitions. [2019-09-10 02:31:28,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 936 transitions. [2019-09-10 02:31:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 02:31:28,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:28,343 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash 15474447, now seen corresponding path program 1 times [2019-09-10 02:31:28,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:28,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:28,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:28,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:28,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:28,520 INFO L87 Difference]: Start difference. First operand 582 states and 936 transitions. Second operand 4 states. [2019-09-10 02:31:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:28,584 INFO L93 Difference]: Finished difference Result 584 states and 937 transitions. [2019-09-10 02:31:28,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:28,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 02:31:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:28,591 INFO L225 Difference]: With dead ends: 584 [2019-09-10 02:31:28,591 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 02:31:28,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 02:31:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-10 02:31:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-10 02:31:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 935 transitions. [2019-09-10 02:31:28,615 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 935 transitions. Word has length 111 [2019-09-10 02:31:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:28,615 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 935 transitions. [2019-09-10 02:31:28,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 935 transitions. [2019-09-10 02:31:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:31:28,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:28,620 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1301085565, now seen corresponding path program 1 times [2019-09-10 02:31:28,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:28,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:28,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:28,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:28,775 INFO L87 Difference]: Start difference. First operand 582 states and 935 transitions. Second operand 4 states. [2019-09-10 02:31:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:28,826 INFO L93 Difference]: Finished difference Result 584 states and 936 transitions. [2019-09-10 02:31:28,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:28,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 02:31:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:28,834 INFO L225 Difference]: With dead ends: 584 [2019-09-10 02:31:28,834 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 02:31:28,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 02:31:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-10 02:31:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-10 02:31:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 934 transitions. [2019-09-10 02:31:28,864 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 934 transitions. Word has length 112 [2019-09-10 02:31:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:28,865 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 934 transitions. [2019-09-10 02:31:28,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 934 transitions. [2019-09-10 02:31:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 02:31:28,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:28,869 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash -116575413, now seen corresponding path program 1 times [2019-09-10 02:31:28,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:29,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:29,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:29,053 INFO L87 Difference]: Start difference. First operand 582 states and 934 transitions. Second operand 4 states. [2019-09-10 02:31:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,100 INFO L93 Difference]: Finished difference Result 584 states and 935 transitions. [2019-09-10 02:31:29,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:29,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 02:31:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,110 INFO L225 Difference]: With dead ends: 584 [2019-09-10 02:31:29,110 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 02:31:29,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 02:31:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-10 02:31:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-10 02:31:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 933 transitions. [2019-09-10 02:31:29,133 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 933 transitions. Word has length 113 [2019-09-10 02:31:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,133 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 933 transitions. [2019-09-10 02:31:29,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 933 transitions. [2019-09-10 02:31:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 02:31:29,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:29,140 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 563674553, now seen corresponding path program 1 times [2019-09-10 02:31:29,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:29,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:31:29,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:31:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:31:29,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:29,382 INFO L87 Difference]: Start difference. First operand 582 states and 933 transitions. Second operand 10 states. [2019-09-10 02:31:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,534 INFO L93 Difference]: Finished difference Result 591 states and 944 transitions. [2019-09-10 02:31:29,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:31:29,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-09-10 02:31:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,545 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:31:29,552 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 02:31:29,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:31:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 02:31:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-09-10 02:31:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:31:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-09-10 02:31:29,580 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-09-10 02:31:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,582 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-09-10 02:31:29,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:31:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-09-10 02:31:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 02:31:29,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:29,593 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash 983191384, now seen corresponding path program 1 times [2019-09-10 02:31:29,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:29,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:29,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:29,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:29,704 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-09-10 02:31:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,747 INFO L93 Difference]: Finished difference Result 587 states and 937 transitions. [2019-09-10 02:31:29,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:29,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 02:31:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,754 INFO L225 Difference]: With dead ends: 587 [2019-09-10 02:31:29,754 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 02:31:29,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 02:31:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-10 02:31:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-10 02:31:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 919 transitions. [2019-09-10 02:31:29,781 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 919 transitions. Word has length 114 [2019-09-10 02:31:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,781 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 919 transitions. [2019-09-10 02:31:29,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 919 transitions. [2019-09-10 02:31:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 02:31:29,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:29,785 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,786 INFO L82 PathProgramCache]: Analyzing trace with hash 881745063, now seen corresponding path program 1 times [2019-09-10 02:31:29,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:29,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:29,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:29,965 INFO L87 Difference]: Start difference. First operand 576 states and 919 transitions. Second operand 6 states. [2019-09-10 02:31:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,191 INFO L93 Difference]: Finished difference Result 579 states and 922 transitions. [2019-09-10 02:31:30,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:30,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-09-10 02:31:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,196 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:31:30,196 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 02:31:30,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 02:31:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-10 02:31:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-10 02:31:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 915 transitions. [2019-09-10 02:31:30,215 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 915 transitions. Word has length 115 [2019-09-10 02:31:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,215 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 915 transitions. [2019-09-10 02:31:30,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 915 transitions. [2019-09-10 02:31:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 02:31:30,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:30,220 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2138395236, now seen corresponding path program 1 times [2019-09-10 02:31:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:30,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:30,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:30,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:30,354 INFO L87 Difference]: Start difference. First operand 576 states and 915 transitions. Second operand 6 states. [2019-09-10 02:31:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,529 INFO L93 Difference]: Finished difference Result 579 states and 918 transitions. [2019-09-10 02:31:30,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:30,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-09-10 02:31:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,534 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:31:30,534 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 02:31:30,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 02:31:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-10 02:31:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-10 02:31:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 911 transitions. [2019-09-10 02:31:30,552 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 911 transitions. Word has length 116 [2019-09-10 02:31:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,553 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 911 transitions. [2019-09-10 02:31:30,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 911 transitions. [2019-09-10 02:31:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:31:30,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:30,557 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 603126668, now seen corresponding path program 1 times [2019-09-10 02:31:30,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:30,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:30,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:30,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:30,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:30,665 INFO L87 Difference]: Start difference. First operand 576 states and 911 transitions. Second operand 6 states. [2019-09-10 02:31:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,860 INFO L93 Difference]: Finished difference Result 579 states and 914 transitions. [2019-09-10 02:31:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:30,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-09-10 02:31:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,865 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:31:30,865 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 02:31:30,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 02:31:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-10 02:31:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-10 02:31:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 907 transitions. [2019-09-10 02:31:30,886 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 907 transitions. Word has length 117 [2019-09-10 02:31:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,886 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 907 transitions. [2019-09-10 02:31:30,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 907 transitions. [2019-09-10 02:31:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:31:30,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:30,890 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1057986572, now seen corresponding path program 1 times [2019-09-10 02:31:30,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:31,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:31,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:31,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:31,075 INFO L87 Difference]: Start difference. First operand 576 states and 907 transitions. Second operand 7 states. [2019-09-10 02:31:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,145 INFO L93 Difference]: Finished difference Result 579 states and 910 transitions. [2019-09-10 02:31:31,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:31,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 02:31:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,150 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:31:31,150 INFO L226 Difference]: Without dead ends: 555 [2019-09-10 02:31:31,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-10 02:31:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-09-10 02:31:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-10 02:31:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 873 transitions. [2019-09-10 02:31:31,167 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 873 transitions. Word has length 117 [2019-09-10 02:31:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,167 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 873 transitions. [2019-09-10 02:31:31,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 873 transitions. [2019-09-10 02:31:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 02:31:31,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:31,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:31,171 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:31,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1567550433, now seen corresponding path program 1 times [2019-09-10 02:31:31,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:31,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:31,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:31,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:31,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:31,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:31,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:31,281 INFO L87 Difference]: Start difference. First operand 555 states and 873 transitions. Second operand 6 states. [2019-09-10 02:31:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,368 INFO L93 Difference]: Finished difference Result 558 states and 876 transitions. [2019-09-10 02:31:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:31,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-10 02:31:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,372 INFO L225 Difference]: With dead ends: 558 [2019-09-10 02:31:31,372 INFO L226 Difference]: Without dead ends: 555 [2019-09-10 02:31:31,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-10 02:31:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-09-10 02:31:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-10 02:31:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 872 transitions. [2019-09-10 02:31:31,391 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 872 transitions. Word has length 118 [2019-09-10 02:31:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,391 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 872 transitions. [2019-09-10 02:31:31,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 872 transitions. [2019-09-10 02:31:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 02:31:31,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:31,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:31,395 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1018460559, now seen corresponding path program 1 times [2019-09-10 02:31:31,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:31,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:31,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:31,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:31,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:31,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:31,501 INFO L87 Difference]: Start difference. First operand 555 states and 872 transitions. Second operand 6 states. [2019-09-10 02:31:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,583 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2019-09-10 02:31:31,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:31,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-10 02:31:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,588 INFO L225 Difference]: With dead ends: 558 [2019-09-10 02:31:31,588 INFO L226 Difference]: Without dead ends: 555 [2019-09-10 02:31:31,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-10 02:31:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-09-10 02:31:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-10 02:31:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 871 transitions. [2019-09-10 02:31:31,606 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 871 transitions. Word has length 119 [2019-09-10 02:31:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,607 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 871 transitions. [2019-09-10 02:31:31,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 871 transitions. [2019-09-10 02:31:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:31:31,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:31,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:31,610 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:31,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1998799322, now seen corresponding path program 1 times [2019-09-10 02:31:31,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:31,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:31,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:31,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:31,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:31,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:31,780 INFO L87 Difference]: Start difference. First operand 555 states and 871 transitions. Second operand 12 states. [2019-09-10 02:31:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,945 INFO L93 Difference]: Finished difference Result 559 states and 874 transitions. [2019-09-10 02:31:31,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:31:31,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-09-10 02:31:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,950 INFO L225 Difference]: With dead ends: 559 [2019-09-10 02:31:31,950 INFO L226 Difference]: Without dead ends: 555 [2019-09-10 02:31:31,952 INFO L628 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-09-10 02:31:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-10 02:31:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-09-10 02:31:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-10 02:31:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 870 transitions. [2019-09-10 02:31:31,968 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 870 transitions. Word has length 120 [2019-09-10 02:31:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,968 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 870 transitions. [2019-09-10 02:31:31,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:31:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 870 transitions. [2019-09-10 02:31:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 02:31:31,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:31,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:31,973 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash 504527096, now seen corresponding path program 1 times [2019-09-10 02:31:31,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:31,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:32,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:31:32,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:32,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:31:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:31:32,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:31:32,180 INFO L87 Difference]: Start difference. First operand 555 states and 870 transitions. Second operand 9 states. [2019-09-10 02:31:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:35,978 INFO L93 Difference]: Finished difference Result 561 states and 891 transitions. [2019-09-10 02:31:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:31:35,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 02:31:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:35,983 INFO L225 Difference]: With dead ends: 561 [2019-09-10 02:31:35,983 INFO L226 Difference]: Without dead ends: 561 [2019-09-10 02:31:35,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:31:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-10 02:31:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-09-10 02:31:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-10 02:31:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 889 transitions. [2019-09-10 02:31:36,001 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 889 transitions. Word has length 121 [2019-09-10 02:31:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:36,001 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 889 transitions. [2019-09-10 02:31:36,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:31:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 889 transitions. [2019-09-10 02:31:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 02:31:36,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:36,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:36,005 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:36,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:36,006 INFO L82 PathProgramCache]: Analyzing trace with hash -250381492, now seen corresponding path program 1 times [2019-09-10 02:31:36,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:36,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:36,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:36,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:36,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:36,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:36,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:31:36,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:36,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:31:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:31:36,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:36,133 INFO L87 Difference]: Start difference. First operand 559 states and 889 transitions. Second operand 8 states. [2019-09-10 02:31:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:42,432 INFO L93 Difference]: Finished difference Result 1469 states and 2349 transitions. [2019-09-10 02:31:42,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:31:42,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-09-10 02:31:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:42,447 INFO L225 Difference]: With dead ends: 1469 [2019-09-10 02:31:42,447 INFO L226 Difference]: Without dead ends: 1469 [2019-09-10 02:31:42,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:31:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-09-10 02:31:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1430. [2019-09-10 02:31:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-09-10 02:31:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2296 transitions. [2019-09-10 02:31:42,506 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2296 transitions. Word has length 122 [2019-09-10 02:31:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:42,506 INFO L475 AbstractCegarLoop]: Abstraction has 1430 states and 2296 transitions. [2019-09-10 02:31:42,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:31:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2296 transitions. [2019-09-10 02:31:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:31:42,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:42,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:42,510 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1214123081, now seen corresponding path program 1 times [2019-09-10 02:31:42,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:42,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:42,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:31:42,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:42,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:31:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:31:42,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:31:42,655 INFO L87 Difference]: Start difference. First operand 1430 states and 2296 transitions. Second operand 9 states. [2019-09-10 02:31:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:49,564 INFO L93 Difference]: Finished difference Result 3140 states and 5126 transitions. [2019-09-10 02:31:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:31:49,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 02:31:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:49,593 INFO L225 Difference]: With dead ends: 3140 [2019-09-10 02:31:49,593 INFO L226 Difference]: Without dead ends: 3140 [2019-09-10 02:31:49,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:31:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2019-09-10 02:31:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 2917. [2019-09-10 02:31:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2019-09-10 02:31:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4711 transitions. [2019-09-10 02:31:49,696 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4711 transitions. Word has length 128 [2019-09-10 02:31:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:49,697 INFO L475 AbstractCegarLoop]: Abstraction has 2917 states and 4711 transitions. [2019-09-10 02:31:49,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:31:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4711 transitions. [2019-09-10 02:31:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:31:49,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:49,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:49,700 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1206363722, now seen corresponding path program 1 times [2019-09-10 02:31:49,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:49,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:49,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:49,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:49,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:31:49,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:49,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:31:49,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:31:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:49,818 INFO L87 Difference]: Start difference. First operand 2917 states and 4711 transitions. Second operand 5 states. [2019-09-10 02:31:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:52,178 INFO L93 Difference]: Finished difference Result 4294 states and 6857 transitions. [2019-09-10 02:31:52,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:52,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-10 02:31:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:52,209 INFO L225 Difference]: With dead ends: 4294 [2019-09-10 02:31:52,209 INFO L226 Difference]: Without dead ends: 4288 [2019-09-10 02:31:52,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-09-10 02:31:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4261. [2019-09-10 02:31:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2019-09-10 02:31:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6797 transitions. [2019-09-10 02:31:52,364 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6797 transitions. Word has length 128 [2019-09-10 02:31:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:52,367 INFO L475 AbstractCegarLoop]: Abstraction has 4261 states and 6797 transitions. [2019-09-10 02:31:52,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:31:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6797 transitions. [2019-09-10 02:31:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:31:52,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:52,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:52,371 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:52,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1039215732, now seen corresponding path program 1 times [2019-09-10 02:31:52,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:52,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:52,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:52,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:52,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:52,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:52,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:52,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:52,579 INFO L87 Difference]: Start difference. First operand 4261 states and 6797 transitions. Second operand 7 states. [2019-09-10 02:31:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:56,837 INFO L93 Difference]: Finished difference Result 8363 states and 13539 transitions. [2019-09-10 02:31:56,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:31:56,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-10 02:31:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:56,938 INFO L225 Difference]: With dead ends: 8363 [2019-09-10 02:31:56,938 INFO L226 Difference]: Without dead ends: 8363 [2019-09-10 02:31:56,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:31:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2019-09-10 02:31:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 8200. [2019-09-10 02:31:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8200 states. [2019-09-10 02:31:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 13229 transitions. [2019-09-10 02:31:57,454 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 13229 transitions. Word has length 128 [2019-09-10 02:31:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:57,455 INFO L475 AbstractCegarLoop]: Abstraction has 8200 states and 13229 transitions. [2019-09-10 02:31:57,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 13229 transitions. [2019-09-10 02:31:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:31:57,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:57,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:57,461 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -944417101, now seen corresponding path program 1 times [2019-09-10 02:31:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:57,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:57,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:57,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:57,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:31:57,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:57,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:31:57,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:31:57,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:57,599 INFO L87 Difference]: Start difference. First operand 8200 states and 13229 transitions. Second operand 5 states. [2019-09-10 02:31:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:57,701 INFO L93 Difference]: Finished difference Result 8422 states and 13591 transitions. [2019-09-10 02:31:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:31:57,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 02:31:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:57,755 INFO L225 Difference]: With dead ends: 8422 [2019-09-10 02:31:57,755 INFO L226 Difference]: Without dead ends: 8422 [2019-09-10 02:31:57,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2019-09-10 02:31:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 8290. [2019-09-10 02:31:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8290 states. [2019-09-10 02:31:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8290 states to 8290 states and 13356 transitions. [2019-09-10 02:31:58,036 INFO L78 Accepts]: Start accepts. Automaton has 8290 states and 13356 transitions. Word has length 133 [2019-09-10 02:31:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:58,038 INFO L475 AbstractCegarLoop]: Abstraction has 8290 states and 13356 transitions. [2019-09-10 02:31:58,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:31:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8290 states and 13356 transitions. [2019-09-10 02:31:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:31:58,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:58,042 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:58,042 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1512564016, now seen corresponding path program 1 times [2019-09-10 02:31:58,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:58,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:58,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:58,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:58,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:58,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:58,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:58,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:58,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:58,165 INFO L87 Difference]: Start difference. First operand 8290 states and 13356 transitions. Second operand 7 states. [2019-09-10 02:31:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:58,367 INFO L93 Difference]: Finished difference Result 9206 states and 14816 transitions. [2019-09-10 02:31:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:58,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-09-10 02:31:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:58,407 INFO L225 Difference]: With dead ends: 9206 [2019-09-10 02:31:58,407 INFO L226 Difference]: Without dead ends: 8290 [2019-09-10 02:31:58,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2019-09-10 02:31:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 8290. [2019-09-10 02:31:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8290 states. [2019-09-10 02:31:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8290 states to 8290 states and 13180 transitions. [2019-09-10 02:31:58,630 INFO L78 Accepts]: Start accepts. Automaton has 8290 states and 13180 transitions. Word has length 140 [2019-09-10 02:31:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:58,630 INFO L475 AbstractCegarLoop]: Abstraction has 8290 states and 13180 transitions. [2019-09-10 02:31:58,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 8290 states and 13180 transitions. [2019-09-10 02:31:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:31:58,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:58,635 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:58,635 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash 260228654, now seen corresponding path program 1 times [2019-09-10 02:31:58,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:58,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:58,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:31:58,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:58,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:58,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:58,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:58,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:58,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:58,785 INFO L87 Difference]: Start difference. First operand 8290 states and 13180 transitions. Second operand 7 states. [2019-09-10 02:32:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:03,160 INFO L93 Difference]: Finished difference Result 8965 states and 14182 transitions. [2019-09-10 02:32:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:32:03,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-09-10 02:32:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:03,202 INFO L225 Difference]: With dead ends: 8965 [2019-09-10 02:32:03,202 INFO L226 Difference]: Without dead ends: 8965 [2019-09-10 02:32:03,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:32:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-09-10 02:32:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8754. [2019-09-10 02:32:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8754 states. [2019-09-10 02:32:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 13806 transitions. [2019-09-10 02:32:03,500 INFO L78 Accepts]: Start accepts. Automaton has 8754 states and 13806 transitions. Word has length 145 [2019-09-10 02:32:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:03,501 INFO L475 AbstractCegarLoop]: Abstraction has 8754 states and 13806 transitions. [2019-09-10 02:32:03,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 8754 states and 13806 transitions. [2019-09-10 02:32:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:32:03,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:03,505 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:03,506 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1820540613, now seen corresponding path program 1 times [2019-09-10 02:32:03,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:03,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:03,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:03,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:03,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:03,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:03,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:32:03,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:03,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:32:03,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:32:03,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:32:03,671 INFO L87 Difference]: Start difference. First operand 8754 states and 13806 transitions. Second operand 11 states. [2019-09-10 02:32:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:10,559 INFO L93 Difference]: Finished difference Result 11369 states and 17714 transitions. [2019-09-10 02:32:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:32:10,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-10 02:32:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:10,613 INFO L225 Difference]: With dead ends: 11369 [2019-09-10 02:32:10,613 INFO L226 Difference]: Without dead ends: 11345 [2019-09-10 02:32:10,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:32:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11345 states. [2019-09-10 02:32:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11345 to 11082. [2019-09-10 02:32:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2019-09-10 02:32:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 17200 transitions. [2019-09-10 02:32:10,907 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 17200 transitions. Word has length 152 [2019-09-10 02:32:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:10,908 INFO L475 AbstractCegarLoop]: Abstraction has 11082 states and 17200 transitions. [2019-09-10 02:32:10,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:32:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 17200 transitions. [2019-09-10 02:32:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:32:10,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:10,912 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:10,913 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1705256668, now seen corresponding path program 1 times [2019-09-10 02:32:10,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:10,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:10,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:11,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:11,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:11,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:11,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:11,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:11,044 INFO L87 Difference]: Start difference. First operand 11082 states and 17200 transitions. Second operand 6 states. [2019-09-10 02:32:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:11,225 INFO L93 Difference]: Finished difference Result 16321 states and 25570 transitions. [2019-09-10 02:32:11,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:11,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-10 02:32:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:11,308 INFO L225 Difference]: With dead ends: 16321 [2019-09-10 02:32:11,308 INFO L226 Difference]: Without dead ends: 16321 [2019-09-10 02:32:11,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16321 states. [2019-09-10 02:32:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16321 to 13480. [2019-09-10 02:32:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13480 states. [2019-09-10 02:32:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13480 states to 13480 states and 21072 transitions. [2019-09-10 02:32:11,783 INFO L78 Accepts]: Start accepts. Automaton has 13480 states and 21072 transitions. Word has length 152 [2019-09-10 02:32:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:11,784 INFO L475 AbstractCegarLoop]: Abstraction has 13480 states and 21072 transitions. [2019-09-10 02:32:11,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 13480 states and 21072 transitions. [2019-09-10 02:32:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:32:11,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:11,789 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:11,789 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:11,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1003656794, now seen corresponding path program 1 times [2019-09-10 02:32:11,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:11,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:11,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:11,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:11,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:11,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:11,926 INFO L87 Difference]: Start difference. First operand 13480 states and 21072 transitions. Second operand 4 states. [2019-09-10 02:32:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:13,832 INFO L93 Difference]: Finished difference Result 28582 states and 46574 transitions. [2019-09-10 02:32:13,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:13,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-10 02:32:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:13,982 INFO L225 Difference]: With dead ends: 28582 [2019-09-10 02:32:13,983 INFO L226 Difference]: Without dead ends: 28582 [2019-09-10 02:32:13,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28582 states. [2019-09-10 02:32:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28582 to 28210. [2019-09-10 02:32:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28210 states. [2019-09-10 02:32:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28210 states to 28210 states and 45535 transitions. [2019-09-10 02:32:14,873 INFO L78 Accepts]: Start accepts. Automaton has 28210 states and 45535 transitions. Word has length 152 [2019-09-10 02:32:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:14,873 INFO L475 AbstractCegarLoop]: Abstraction has 28210 states and 45535 transitions. [2019-09-10 02:32:14,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 28210 states and 45535 transitions. [2019-09-10 02:32:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:32:14,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:14,879 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:14,879 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:14,880 INFO L82 PathProgramCache]: Analyzing trace with hash 755748053, now seen corresponding path program 1 times [2019-09-10 02:32:14,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:14,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:14,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:14,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:14,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:14,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:14,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:14,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:14,979 INFO L87 Difference]: Start difference. First operand 28210 states and 45535 transitions. Second operand 4 states. [2019-09-10 02:32:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:17,131 INFO L93 Difference]: Finished difference Result 60798 states and 106235 transitions. [2019-09-10 02:32:17,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:17,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-10 02:32:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:18,591 INFO L225 Difference]: With dead ends: 60798 [2019-09-10 02:32:18,591 INFO L226 Difference]: Without dead ends: 60798 [2019-09-10 02:32:18,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60798 states. [2019-09-10 02:32:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60798 to 59951. [2019-09-10 02:32:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-09-10 02:32:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 102549 transitions. [2019-09-10 02:32:20,359 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 102549 transitions. Word has length 151 [2019-09-10 02:32:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:20,359 INFO L475 AbstractCegarLoop]: Abstraction has 59951 states and 102549 transitions. [2019-09-10 02:32:20,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 102549 transitions. [2019-09-10 02:32:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 02:32:20,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:20,368 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:20,368 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1812499816, now seen corresponding path program 1 times [2019-09-10 02:32:20,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:20,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:20,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:20,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:20,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:20,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:20,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:20,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:20,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:20,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:20,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:20,473 INFO L87 Difference]: Start difference. First operand 59951 states and 102549 transitions. Second operand 4 states. [2019-09-10 02:32:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:23,287 INFO L93 Difference]: Finished difference Result 131732 states and 259479 transitions. [2019-09-10 02:32:23,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:23,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-10 02:32:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:26,375 INFO L225 Difference]: With dead ends: 131732 [2019-09-10 02:32:26,376 INFO L226 Difference]: Without dead ends: 131732 [2019-09-10 02:32:26,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131732 states. [2019-09-10 02:32:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131732 to 129728. [2019-09-10 02:32:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129728 states. [2019-09-10 02:32:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129728 states to 129728 states and 245124 transitions. [2019-09-10 02:32:33,292 INFO L78 Accepts]: Start accepts. Automaton has 129728 states and 245124 transitions. Word has length 154 [2019-09-10 02:32:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:33,292 INFO L475 AbstractCegarLoop]: Abstraction has 129728 states and 245124 transitions. [2019-09-10 02:32:33,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 129728 states and 245124 transitions. [2019-09-10 02:32:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 02:32:33,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:33,298 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:33,299 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash 351647052, now seen corresponding path program 1 times [2019-09-10 02:32:33,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:33,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:33,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:33,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:33,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:33,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:33,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:33,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:33,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:33,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:33,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:33,399 INFO L87 Difference]: Start difference. First operand 129728 states and 245124 transitions. Second operand 4 states. [2019-09-10 02:32:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:38,965 INFO L93 Difference]: Finished difference Result 291678 states and 697595 transitions. [2019-09-10 02:32:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:38,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-10 02:32:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:46,732 INFO L225 Difference]: With dead ends: 291678 [2019-09-10 02:32:46,732 INFO L226 Difference]: Without dead ends: 291678 [2019-09-10 02:32:46,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291678 states. [2019-09-10 02:32:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291678 to 286737. [2019-09-10 02:32:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286737 states. [2019-09-10 02:33:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286737 states to 286737 states and 637135 transitions. [2019-09-10 02:33:05,337 INFO L78 Accepts]: Start accepts. Automaton has 286737 states and 637135 transitions. Word has length 155 [2019-09-10 02:33:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:05,337 INFO L475 AbstractCegarLoop]: Abstraction has 286737 states and 637135 transitions. [2019-09-10 02:33:05,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:33:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 286737 states and 637135 transitions. [2019-09-10 02:33:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 02:33:05,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:05,343 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:33:05,344 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:05,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:05,344 INFO L82 PathProgramCache]: Analyzing trace with hash -995557697, now seen corresponding path program 1 times [2019-09-10 02:33:05,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:05,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:05,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:05,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:33:05,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:05,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:33:05,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:05,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:33:05,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:33:05,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:33:05,463 INFO L87 Difference]: Start difference. First operand 286737 states and 637135 transitions. Second operand 4 states. [2019-09-10 02:33:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:36,254 INFO L93 Difference]: Finished difference Result 661802 states and 2117690 transitions. [2019-09-10 02:33:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:33:36,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-10 02:33:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:58,240 INFO L225 Difference]: With dead ends: 661802 [2019-09-10 02:33:58,240 INFO L226 Difference]: Without dead ends: 661790 [2019-09-10 02:33:58,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:33:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661790 states. [2019-09-10 02:34:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661790 to 649106. [2019-09-10 02:34:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649106 states.