java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:46:31,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:46:31,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:46:31,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:46:31,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:46:31,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:46:31,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:46:31,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:46:31,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:46:31,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:46:31,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:46:31,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:46:31,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:46:31,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:46:31,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:46:31,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:46:31,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:46:31,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:46:31,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:46:31,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:46:31,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:46:31,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:46:31,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:46:31,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:46:31,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:46:31,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:46:31,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:46:31,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:46:31,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:46:31,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:46:31,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:46:31,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:46:31,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:46:31,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:46:31,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:46:31,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:46:31,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:46:31,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:46:31,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:46:31,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:46:31,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:46:31,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:46:31,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:46:31,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:46:31,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:46:31,420 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:46:31,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:46:31,421 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:46:31,421 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:46:31,421 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:46:31,421 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:46:31,422 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:46:31,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:46:31,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:46:31,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:46:31,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:46:31,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:46:31,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:46:31,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:46:31,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:46:31,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:46:31,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:46:31,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:46:31,424 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:46:31,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:46:31,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:46:31,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:46:31,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:46:31,425 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:46:31,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:46:31,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:46:31,426 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:46:31,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:46:31,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:46:31,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:46:31,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:46:31,475 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:46:31,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product28.cil.c [2019-10-03 02:46:31,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ecb66c3/ad8449e5cb2e434baf9e590bc2517ed2/FLAGdf1540d4e [2019-10-03 02:46:32,170 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:46:32,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product28.cil.c [2019-10-03 02:46:32,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ecb66c3/ad8449e5cb2e434baf9e590bc2517ed2/FLAGdf1540d4e [2019-10-03 02:46:32,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ecb66c3/ad8449e5cb2e434baf9e590bc2517ed2 [2019-10-03 02:46:32,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:46:32,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:46:32,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:46:32,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:46:32,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:46:32,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:46:32" (1/1) ... [2019-10-03 02:46:32,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74752006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:32, skipping insertion in model container [2019-10-03 02:46:32,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:46:32" (1/1) ... [2019-10-03 02:46:32,400 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:46:32,494 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:46:33,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:46:33,191 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:46:33,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:46:33,454 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:46:33,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33 WrapperNode [2019-10-03 02:46:33,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:46:33,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:46:33,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:46:33,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:46:33,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (1/1) ... [2019-10-03 02:46:33,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (1/1) ... [2019-10-03 02:46:33,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (1/1) ... [2019-10-03 02:46:33,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (1/1) ... [2019-10-03 02:46:33,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (1/1) ... [2019-10-03 02:46:33,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (1/1) ... [2019-10-03 02:46:33,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (1/1) ... [2019-10-03 02:46:33,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:46:33,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:46:33,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:46:33,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:46:33,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:46:33,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:46:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:46:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:46:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:46:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:46:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:46:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:46:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:46:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:46:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:46:33,724 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:46:33,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:46:33,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:46:33,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:46:33,726 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:46:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:46:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:46:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:46:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:46:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:46:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:46:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:46:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:46:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:46:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:46:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:46:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:46:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:46:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:46:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:46:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:46:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:46:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:46:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:46:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:46:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:46:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:46:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:46:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:46:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:46:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:46:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:46:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:46:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-03 02:46:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:46:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-03 02:46:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:46:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:46:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:46:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:46:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:46:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:46:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:46:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:46:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:46:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:46:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:46:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:46:33,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:46:33,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:46:33,737 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:46:33,737 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:46:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:46:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:46:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:46:33,739 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:46:33,739 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:46:33,740 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:46:33,740 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:46:33,740 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:46:33,740 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:46:33,740 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:46:33,741 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:46:33,742 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:46:33,742 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:46:33,742 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:46:33,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:46:33,743 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:46:33,743 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:46:33,744 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:46:33,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:46:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:46:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:46:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:46:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:46:33,746 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:46:33,746 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:46:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:46:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:46:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:46:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:46:33,747 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:46:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:46:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:46:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:46:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:46:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:46:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:46:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:46:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:46:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:46:33,750 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:46:33,750 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:46:33,750 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:46:33,750 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:46:33,751 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:46:33,751 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:46:33,751 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:46:33,751 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:46:33,751 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:46:33,752 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:46:33,752 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:46:33,752 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:46:33,752 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:46:33,752 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:46:33,753 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:46:33,753 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:46:33,754 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:46:33,754 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:46:33,755 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:46:33,755 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:46:33,755 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:46:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:46:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:46:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:46:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:46:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:46:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:46:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:46:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-03 02:46:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:46:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-03 02:46:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:46:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:46:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:46:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:46:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:46:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:46:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:46:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:46:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:46:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:46:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:46:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:46:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:46:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:46:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:46:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:46:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:46:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:46:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:46:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:46:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:46:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:46:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:46:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:46:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:46:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:46:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:46:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:46:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:46:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:46:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:46:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:46:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:46:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:46:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:46:36,312 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:46:36,312 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:46:36,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:46:36 BoogieIcfgContainer [2019-10-03 02:46:36,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:46:36,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:46:36,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:46:36,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:46:36,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:46:32" (1/3) ... [2019-10-03 02:46:36,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1665dab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:46:36, skipping insertion in model container [2019-10-03 02:46:36,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:33" (2/3) ... [2019-10-03 02:46:36,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1665dab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:46:36, skipping insertion in model container [2019-10-03 02:46:36,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:46:36" (3/3) ... [2019-10-03 02:46:36,325 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2019-10-03 02:46:36,336 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:46:36,351 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:46:36,371 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:46:36,404 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:46:36,404 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:46:36,404 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:46:36,405 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:46:36,405 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:46:36,405 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:46:36,405 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:46:36,405 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:46:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states. [2019-10-03 02:46:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:46:36,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:36,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:36,493 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash 961296188, now seen corresponding path program 1 times [2019-10-03 02:46:36,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:36,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:36,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:37,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:37,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:37,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:37,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:37,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:37,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:37,251 INFO L87 Difference]: Start difference. First operand 793 states. Second operand 4 states. [2019-10-03 02:46:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:37,413 INFO L93 Difference]: Finished difference Result 637 states and 1006 transitions. [2019-10-03 02:46:37,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:37,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-03 02:46:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:37,448 INFO L225 Difference]: With dead ends: 637 [2019-10-03 02:46:37,448 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:46:37,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:46:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-03 02:46:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:46:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 994 transitions. [2019-10-03 02:46:37,557 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 994 transitions. Word has length 87 [2019-10-03 02:46:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:37,557 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 994 transitions. [2019-10-03 02:46:37,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 994 transitions. [2019-10-03 02:46:37,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:46:37,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:37,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:37,563 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1704388894, now seen corresponding path program 1 times [2019-10-03 02:46:37,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:37,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:37,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:37,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:37,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:37,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:37,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:37,812 INFO L87 Difference]: Start difference. First operand 626 states and 994 transitions. Second operand 4 states. [2019-10-03 02:46:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:37,901 INFO L93 Difference]: Finished difference Result 628 states and 995 transitions. [2019-10-03 02:46:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:37,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-03 02:46:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:37,912 INFO L225 Difference]: With dead ends: 628 [2019-10-03 02:46:37,913 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:46:37,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:46:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-03 02:46:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:46:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-10-03 02:46:37,975 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 90 [2019-10-03 02:46:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:37,976 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-10-03 02:46:37,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-10-03 02:46:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:46:37,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:37,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:37,981 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1677160523, now seen corresponding path program 1 times [2019-10-03 02:46:37,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:37,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:37,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:37,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:38,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:38,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:38,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:38,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:38,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:38,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:38,190 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 4 states. [2019-10-03 02:46:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:38,252 INFO L93 Difference]: Finished difference Result 628 states and 994 transitions. [2019-10-03 02:46:38,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:38,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:46:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:38,261 INFO L225 Difference]: With dead ends: 628 [2019-10-03 02:46:38,261 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:46:38,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:46:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-03 02:46:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:46:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-10-03 02:46:38,297 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 91 [2019-10-03 02:46:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:38,297 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-10-03 02:46:38,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-10-03 02:46:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:46:38,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:38,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:38,300 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:38,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1700539194, now seen corresponding path program 1 times [2019-10-03 02:46:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:38,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:38,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:38,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:38,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:38,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:38,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:38,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:38,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:38,491 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 4 states. [2019-10-03 02:46:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:38,554 INFO L93 Difference]: Finished difference Result 628 states and 993 transitions. [2019-10-03 02:46:38,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:38,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:46:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:38,561 INFO L225 Difference]: With dead ends: 628 [2019-10-03 02:46:38,562 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:46:38,562 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:46:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-03 02:46:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:46:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 991 transitions. [2019-10-03 02:46:38,587 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 991 transitions. Word has length 92 [2019-10-03 02:46:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:38,588 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 991 transitions. [2019-10-03 02:46:38,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 991 transitions. [2019-10-03 02:46:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:46:38,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:38,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:38,590 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1002231129, now seen corresponding path program 1 times [2019-10-03 02:46:38,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:38,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:38,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:38,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:38,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:38,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:38,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:38,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:38,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:38,763 INFO L87 Difference]: Start difference. First operand 626 states and 991 transitions. Second operand 4 states. [2019-10-03 02:46:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:38,837 INFO L93 Difference]: Finished difference Result 628 states and 992 transitions. [2019-10-03 02:46:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:38,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-03 02:46:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:38,844 INFO L225 Difference]: With dead ends: 628 [2019-10-03 02:46:38,845 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:46:38,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:46:38,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-03 02:46:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:46:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 990 transitions. [2019-10-03 02:46:38,875 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 990 transitions. Word has length 93 [2019-10-03 02:46:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:38,875 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 990 transitions. [2019-10-03 02:46:38,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 990 transitions. [2019-10-03 02:46:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:46:38,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:38,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:38,879 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:38,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1978692950, now seen corresponding path program 1 times [2019-10-03 02:46:38,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:38,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:38,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:38,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:38,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:39,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:39,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:39,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:39,083 INFO L87 Difference]: Start difference. First operand 626 states and 990 transitions. Second operand 10 states. [2019-10-03 02:46:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:39,254 INFO L93 Difference]: Finished difference Result 635 states and 1001 transitions. [2019-10-03 02:46:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:46:39,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-03 02:46:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:39,260 INFO L225 Difference]: With dead ends: 635 [2019-10-03 02:46:39,260 INFO L226 Difference]: Without dead ends: 635 [2019-10-03 02:46:39,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:46:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-03 02:46:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-10-03 02:46:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-03 02:46:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 999 transitions. [2019-10-03 02:46:39,307 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 999 transitions. Word has length 94 [2019-10-03 02:46:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:39,308 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 999 transitions. [2019-10-03 02:46:39,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:46:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 999 transitions. [2019-10-03 02:46:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:46:39,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:39,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:39,313 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 48073845, now seen corresponding path program 1 times [2019-10-03 02:46:39,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:39,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:39,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:39,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:39,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:39,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:39,507 INFO L87 Difference]: Start difference. First operand 633 states and 999 transitions. Second operand 4 states. [2019-10-03 02:46:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:39,572 INFO L93 Difference]: Finished difference Result 631 states and 994 transitions. [2019-10-03 02:46:39,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:39,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-03 02:46:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:39,580 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:46:39,580 INFO L226 Difference]: Without dead ends: 620 [2019-10-03 02:46:39,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-03 02:46:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-03 02:46:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-03 02:46:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 976 transitions. [2019-10-03 02:46:39,605 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 976 transitions. Word has length 94 [2019-10-03 02:46:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:39,606 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 976 transitions. [2019-10-03 02:46:39,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 976 transitions. [2019-10-03 02:46:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:46:39,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:39,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:39,609 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1242574475, now seen corresponding path program 1 times [2019-10-03 02:46:39,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:39,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:39,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:39,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:39,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:39,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:39,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:39,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:39,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:39,744 INFO L87 Difference]: Start difference. First operand 620 states and 976 transitions. Second operand 6 states. [2019-10-03 02:46:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:39,968 INFO L93 Difference]: Finished difference Result 623 states and 979 transitions. [2019-10-03 02:46:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:39,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 02:46:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:39,974 INFO L225 Difference]: With dead ends: 623 [2019-10-03 02:46:39,975 INFO L226 Difference]: Without dead ends: 620 [2019-10-03 02:46:39,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-03 02:46:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-03 02:46:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-03 02:46:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 972 transitions. [2019-10-03 02:46:39,996 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 972 transitions. Word has length 95 [2019-10-03 02:46:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:39,997 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 972 transitions. [2019-10-03 02:46:39,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 972 transitions. [2019-10-03 02:46:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:46:39,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:39,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:39,999 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:39,999 INFO L82 PathProgramCache]: Analyzing trace with hash 96991961, now seen corresponding path program 1 times [2019-10-03 02:46:39,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:40,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:40,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:40,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:40,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:40,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:40,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:40,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:40,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:40,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:40,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:40,119 INFO L87 Difference]: Start difference. First operand 620 states and 972 transitions. Second operand 6 states. [2019-10-03 02:46:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:40,325 INFO L93 Difference]: Finished difference Result 623 states and 975 transitions. [2019-10-03 02:46:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:40,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:46:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:40,330 INFO L225 Difference]: With dead ends: 623 [2019-10-03 02:46:40,331 INFO L226 Difference]: Without dead ends: 620 [2019-10-03 02:46:40,332 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-03 02:46:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-03 02:46:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-03 02:46:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 968 transitions. [2019-10-03 02:46:40,359 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 968 transitions. Word has length 96 [2019-10-03 02:46:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:40,359 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 968 transitions. [2019-10-03 02:46:40,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 968 transitions. [2019-10-03 02:46:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:46:40,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:40,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:40,361 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash 44864186, now seen corresponding path program 1 times [2019-10-03 02:46:40,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:40,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:40,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:40,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:40,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:40,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:40,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:40,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:40,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:40,556 INFO L87 Difference]: Start difference. First operand 620 states and 968 transitions. Second operand 6 states. [2019-10-03 02:46:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:40,808 INFO L93 Difference]: Finished difference Result 623 states and 971 transitions. [2019-10-03 02:46:40,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:40,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-03 02:46:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:40,817 INFO L225 Difference]: With dead ends: 623 [2019-10-03 02:46:40,818 INFO L226 Difference]: Without dead ends: 620 [2019-10-03 02:46:40,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-03 02:46:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-03 02:46:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-03 02:46:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 964 transitions. [2019-10-03 02:46:40,845 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 964 transitions. Word has length 97 [2019-10-03 02:46:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:40,846 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 964 transitions. [2019-10-03 02:46:40,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 964 transitions. [2019-10-03 02:46:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:46:40,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:40,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:40,849 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2010410810, now seen corresponding path program 1 times [2019-10-03 02:46:40,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:40,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:40,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:41,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:41,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:41,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:41,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:41,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:41,026 INFO L87 Difference]: Start difference. First operand 620 states and 964 transitions. Second operand 7 states. [2019-10-03 02:46:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:41,111 INFO L93 Difference]: Finished difference Result 623 states and 967 transitions. [2019-10-03 02:46:41,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:41,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-03 02:46:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:41,118 INFO L225 Difference]: With dead ends: 623 [2019-10-03 02:46:41,119 INFO L226 Difference]: Without dead ends: 599 [2019-10-03 02:46:41,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-03 02:46:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-03 02:46:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-03 02:46:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 930 transitions. [2019-10-03 02:46:41,147 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 930 transitions. Word has length 97 [2019-10-03 02:46:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:41,147 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 930 transitions. [2019-10-03 02:46:41,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 930 transitions. [2019-10-03 02:46:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:46:41,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:41,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:41,149 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash -200111170, now seen corresponding path program 1 times [2019-10-03 02:46:41,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:41,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:41,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:41,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:41,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:41,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:41,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:41,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:41,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:41,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:41,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:41,288 INFO L87 Difference]: Start difference. First operand 599 states and 930 transitions. Second operand 6 states. [2019-10-03 02:46:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:41,379 INFO L93 Difference]: Finished difference Result 602 states and 933 transitions. [2019-10-03 02:46:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:41,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-03 02:46:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:41,385 INFO L225 Difference]: With dead ends: 602 [2019-10-03 02:46:41,385 INFO L226 Difference]: Without dead ends: 599 [2019-10-03 02:46:41,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-03 02:46:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-03 02:46:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-03 02:46:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 929 transitions. [2019-10-03 02:46:41,407 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 929 transitions. Word has length 98 [2019-10-03 02:46:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:41,408 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 929 transitions. [2019-10-03 02:46:41,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 929 transitions. [2019-10-03 02:46:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:46:41,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:41,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:41,410 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:41,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2128394241, now seen corresponding path program 1 times [2019-10-03 02:46:41,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:41,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:41,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:41,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:41,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:41,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:41,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:41,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:41,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:41,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:41,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:41,551 INFO L87 Difference]: Start difference. First operand 599 states and 929 transitions. Second operand 6 states. [2019-10-03 02:46:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:41,650 INFO L93 Difference]: Finished difference Result 602 states and 932 transitions. [2019-10-03 02:46:41,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:41,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-03 02:46:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:41,656 INFO L225 Difference]: With dead ends: 602 [2019-10-03 02:46:41,656 INFO L226 Difference]: Without dead ends: 599 [2019-10-03 02:46:41,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-03 02:46:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-03 02:46:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-03 02:46:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 928 transitions. [2019-10-03 02:46:41,712 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 928 transitions. Word has length 99 [2019-10-03 02:46:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:41,712 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 928 transitions. [2019-10-03 02:46:41,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 928 transitions. [2019-10-03 02:46:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 02:46:41,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:41,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:41,715 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -404641629, now seen corresponding path program 1 times [2019-10-03 02:46:41,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:41,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:41,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:41,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:41,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:46:41,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:41,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:46:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:46:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:46:41,902 INFO L87 Difference]: Start difference. First operand 599 states and 928 transitions. Second operand 12 states. [2019-10-03 02:46:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:42,086 INFO L93 Difference]: Finished difference Result 603 states and 931 transitions. [2019-10-03 02:46:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:46:42,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-03 02:46:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:42,092 INFO L225 Difference]: With dead ends: 603 [2019-10-03 02:46:42,092 INFO L226 Difference]: Without dead ends: 599 [2019-10-03 02:46:42,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-03 02:46:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-03 02:46:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-03 02:46:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 927 transitions. [2019-10-03 02:46:42,116 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 927 transitions. Word has length 100 [2019-10-03 02:46:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:42,117 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 927 transitions. [2019-10-03 02:46:42,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:46:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 927 transitions. [2019-10-03 02:46:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:46:42,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:42,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:42,119 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:42,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1635405980, now seen corresponding path program 1 times [2019-10-03 02:46:42,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:42,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:42,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:42,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:42,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:42,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:42,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:42,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:42,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:42,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:42,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:42,316 INFO L87 Difference]: Start difference. First operand 599 states and 927 transitions. Second operand 10 states. [2019-10-03 02:46:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:49,457 INFO L93 Difference]: Finished difference Result 1234 states and 1953 transitions. [2019-10-03 02:46:49,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:46:49,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-10-03 02:46:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:49,468 INFO L225 Difference]: With dead ends: 1234 [2019-10-03 02:46:49,468 INFO L226 Difference]: Without dead ends: 1234 [2019-10-03 02:46:49,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:46:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-10-03 02:46:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1204. [2019-10-03 02:46:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-10-03 02:46:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1913 transitions. [2019-10-03 02:46:49,511 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1913 transitions. Word has length 101 [2019-10-03 02:46:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:49,511 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1913 transitions. [2019-10-03 02:46:49,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:46:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1913 transitions. [2019-10-03 02:46:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 02:46:49,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:49,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:49,513 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:49,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1559201877, now seen corresponding path program 1 times [2019-10-03 02:46:49,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:49,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:49,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:49,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:49,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:49,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:49,684 INFO L87 Difference]: Start difference. First operand 1204 states and 1913 transitions. Second operand 10 states. [2019-10-03 02:46:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:56,824 INFO L93 Difference]: Finished difference Result 2617 states and 4243 transitions. [2019-10-03 02:46:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:46:56,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-10-03 02:46:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:56,844 INFO L225 Difference]: With dead ends: 2617 [2019-10-03 02:46:56,844 INFO L226 Difference]: Without dead ends: 2617 [2019-10-03 02:46:56,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:46:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-10-03 02:46:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2576. [2019-10-03 02:46:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-10-03 02:46:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 4181 transitions. [2019-10-03 02:46:56,939 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 4181 transitions. Word has length 102 [2019-10-03 02:46:56,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:56,939 INFO L475 AbstractCegarLoop]: Abstraction has 2576 states and 4181 transitions. [2019-10-03 02:46:56,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:46:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 4181 transitions. [2019-10-03 02:46:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:46:56,941 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:56,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:56,941 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:56,942 INFO L82 PathProgramCache]: Analyzing trace with hash -962393984, now seen corresponding path program 1 times [2019-10-03 02:46:56,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:56,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:57,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:57,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:57,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:57,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:57,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:57,137 INFO L87 Difference]: Start difference. First operand 2576 states and 4181 transitions. Second operand 10 states. [2019-10-03 02:47:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:04,210 INFO L93 Difference]: Finished difference Result 5847 states and 9709 transitions. [2019-10-03 02:47:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:04,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-10-03 02:47:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:04,251 INFO L225 Difference]: With dead ends: 5847 [2019-10-03 02:47:04,252 INFO L226 Difference]: Without dead ends: 5847 [2019-10-03 02:47:04,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2019-10-03 02:47:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5784. [2019-10-03 02:47:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-10-03 02:47:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 9591 transitions. [2019-10-03 02:47:04,583 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 9591 transitions. Word has length 103 [2019-10-03 02:47:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:04,583 INFO L475 AbstractCegarLoop]: Abstraction has 5784 states and 9591 transitions. [2019-10-03 02:47:04,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 9591 transitions. [2019-10-03 02:47:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 02:47:04,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:04,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:04,586 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1204185167, now seen corresponding path program 1 times [2019-10-03 02:47:04,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:04,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:04,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:04,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:04,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:04,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:04,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:04,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:04,752 INFO L87 Difference]: Start difference. First operand 5784 states and 9591 transitions. Second operand 10 states. [2019-10-03 02:47:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:11,802 INFO L93 Difference]: Finished difference Result 13690 states and 23384 transitions. [2019-10-03 02:47:11,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:11,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-10-03 02:47:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:11,912 INFO L225 Difference]: With dead ends: 13690 [2019-10-03 02:47:11,912 INFO L226 Difference]: Without dead ends: 13690 [2019-10-03 02:47:11,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13690 states. [2019-10-03 02:47:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13690 to 13583. [2019-10-03 02:47:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13583 states. [2019-10-03 02:47:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13583 states to 13583 states and 23106 transitions. [2019-10-03 02:47:12,538 INFO L78 Accepts]: Start accepts. Automaton has 13583 states and 23106 transitions. Word has length 104 [2019-10-03 02:47:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:12,539 INFO L475 AbstractCegarLoop]: Abstraction has 13583 states and 23106 transitions. [2019-10-03 02:47:12,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 13583 states and 23106 transitions. [2019-10-03 02:47:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 02:47:12,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:12,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:12,541 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash 494065764, now seen corresponding path program 1 times [2019-10-03 02:47:12,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:12,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:12,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:12,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:12,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:12,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:12,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:12,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:12,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:12,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:12,724 INFO L87 Difference]: Start difference. First operand 13583 states and 23106 transitions. Second operand 10 states. [2019-10-03 02:47:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:22,280 INFO L93 Difference]: Finished difference Result 33680 states and 59690 transitions. [2019-10-03 02:47:22,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:22,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-03 02:47:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:22,503 INFO L225 Difference]: With dead ends: 33680 [2019-10-03 02:47:22,503 INFO L226 Difference]: Without dead ends: 33680 [2019-10-03 02:47:22,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33680 states. [2019-10-03 02:47:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33680 to 33485. [2019-10-03 02:47:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33485 states. [2019-10-03 02:47:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33485 states to 33485 states and 58900 transitions. [2019-10-03 02:47:24,030 INFO L78 Accepts]: Start accepts. Automaton has 33485 states and 58900 transitions. Word has length 105 [2019-10-03 02:47:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:24,030 INFO L475 AbstractCegarLoop]: Abstraction has 33485 states and 58900 transitions. [2019-10-03 02:47:24,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33485 states and 58900 transitions. [2019-10-03 02:47:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 02:47:24,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:24,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:24,032 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash 800604403, now seen corresponding path program 1 times [2019-10-03 02:47:24,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:24,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:24,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:24,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:24,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:24,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:24,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:24,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:24,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:24,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:24,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:24,168 INFO L87 Difference]: Start difference. First operand 33485 states and 58900 transitions. Second operand 10 states. [2019-10-03 02:47:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:32,692 INFO L93 Difference]: Finished difference Result 87663 states and 163391 transitions. [2019-10-03 02:47:32,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:32,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-03 02:47:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:33,232 INFO L225 Difference]: With dead ends: 87663 [2019-10-03 02:47:33,232 INFO L226 Difference]: Without dead ends: 87663 [2019-10-03 02:47:33,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:47:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87663 states. [2019-10-03 02:47:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87663 to 87292. [2019-10-03 02:47:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87292 states. [2019-10-03 02:47:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87292 states to 87292 states and 160809 transitions. [2019-10-03 02:47:39,266 INFO L78 Accepts]: Start accepts. Automaton has 87292 states and 160809 transitions. Word has length 106 [2019-10-03 02:47:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:39,266 INFO L475 AbstractCegarLoop]: Abstraction has 87292 states and 160809 transitions. [2019-10-03 02:47:39,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 87292 states and 160809 transitions. [2019-10-03 02:47:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 02:47:39,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:39,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:39,269 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1011955316, now seen corresponding path program 1 times [2019-10-03 02:47:39,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:39,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:39,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:39,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:39,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:39,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:39,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:39,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:39,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:39,364 INFO L87 Difference]: Start difference. First operand 87292 states and 160809 transitions. Second operand 3 states. [2019-10-03 02:47:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:45,166 INFO L93 Difference]: Finished difference Result 174509 states and 360555 transitions. [2019-10-03 02:47:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:45,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-03 02:47:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:46,607 INFO L225 Difference]: With dead ends: 174509 [2019-10-03 02:47:46,607 INFO L226 Difference]: Without dead ends: 174509 [2019-10-03 02:47:46,607 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174509 states. [2019-10-03 02:47:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174509 to 174507. [2019-10-03 02:47:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174507 states. [2019-10-03 02:47:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174507 states to 174507 states and 360554 transitions. [2019-10-03 02:47:59,914 INFO L78 Accepts]: Start accepts. Automaton has 174507 states and 360554 transitions. Word has length 106 [2019-10-03 02:47:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:59,914 INFO L475 AbstractCegarLoop]: Abstraction has 174507 states and 360554 transitions. [2019-10-03 02:47:59,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 174507 states and 360554 transitions. [2019-10-03 02:47:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 02:47:59,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:59,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:59,916 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:59,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1304449025, now seen corresponding path program 1 times [2019-10-03 02:47:59,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:59,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:59,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:48:00,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:00,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:00,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:00,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:00,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:00,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:00,010 INFO L87 Difference]: Start difference. First operand 174507 states and 360554 transitions. Second operand 3 states. [2019-10-03 02:48:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:11,295 INFO L93 Difference]: Finished difference Result 348941 states and 843366 transitions. [2019-10-03 02:48:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:11,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-03 02:48:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:15,148 INFO L225 Difference]: With dead ends: 348941 [2019-10-03 02:48:15,148 INFO L226 Difference]: Without dead ends: 348941 [2019-10-03 02:48:15,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348941 states. [2019-10-03 02:48:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348941 to 348938. [2019-10-03 02:48:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348938 states. [2019-10-03 02:49:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348938 states to 348938 states and 843364 transitions. [2019-10-03 02:49:05,197 INFO L78 Accepts]: Start accepts. Automaton has 348938 states and 843364 transitions. Word has length 107 [2019-10-03 02:49:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:05,197 INFO L475 AbstractCegarLoop]: Abstraction has 348938 states and 843364 transitions. [2019-10-03 02:49:05,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:49:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 348938 states and 843364 transitions. [2019-10-03 02:49:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 02:49:05,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:05,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:49:05,199 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1781823318, now seen corresponding path program 1 times [2019-10-03 02:49:05,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:05,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:05,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:49:05,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:05,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:49:05,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:05,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:49:05,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:49:05,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:49:05,298 INFO L87 Difference]: Start difference. First operand 348938 states and 843364 transitions. Second operand 3 states. [2019-10-03 02:49:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:56,805 INFO L93 Difference]: Finished difference Result 697805 states and 2080603 transitions. [2019-10-03 02:49:56,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:49:56,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-03 02:49:56,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:06,677 INFO L225 Difference]: With dead ends: 697805 [2019-10-03 02:50:06,677 INFO L226 Difference]: Without dead ends: 697805 [2019-10-03 02:50:06,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697805 states.