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_spec14_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:30:43,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:30:43,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:30:43,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:30:43,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:30:43,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:30:43,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:30:43,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:30:43,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:30:43,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:30:43,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:30:43,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:30:43,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:30:43,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:30:43,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:30:43,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:30:43,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:30:43,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:30:43,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:30:43,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:30:43,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:30:43,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:30:43,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:30:43,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:30:43,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:30:43,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:30:43,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:30:43,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:30:43,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:30:43,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:30:43,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:30:43,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:30:43,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:30:43,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:30:43,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:30:43,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:30:43,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:30:43,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:30:43,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:30:43,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:30:43,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:30:43,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:30:43,359 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:30:43,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:30:43,360 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:30:43,361 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:30:43,361 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:30:43,361 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:30:43,362 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:30:43,362 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:30:43,362 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:30:43,362 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:30:43,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:30:43,365 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:30:43,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:30:43,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:30:43,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:30:43,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:30:43,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:30:43,366 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:30:43,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:30:43,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:30:43,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:30:43,367 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:30:43,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:30:43,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:30:43,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:30:43,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:30:43,368 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:30:43,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:30:43,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:30:43,369 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:30:43,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:30:43,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:30:43,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:30:43,434 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:30:43,435 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:30:43,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-09-10 02:30:43,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20740c649/c7eeec115da2451da50c9be5b255ee1f/FLAG77c61d80a [2019-09-10 02:30:44,118 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:30:44,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-09-10 02:30:44,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20740c649/c7eeec115da2451da50c9be5b255ee1f/FLAG77c61d80a [2019-09-10 02:30:44,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20740c649/c7eeec115da2451da50c9be5b255ee1f [2019-09-10 02:30:44,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:30:44,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:30:44,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:30:44,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:30:44,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:30:44,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:30:44" (1/1) ... [2019-09-10 02:30:44,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672fd1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:44, skipping insertion in model container [2019-09-10 02:30:44,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:30:44" (1/1) ... [2019-09-10 02:30:44,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:30:44,492 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:30:45,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:30:45,153 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:30:45,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:30:45,461 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:30:45,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45 WrapperNode [2019-09-10 02:30:45,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:30:45,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:30:45,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:30:45,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:30:45,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (1/1) ... [2019-09-10 02:30:45,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (1/1) ... [2019-09-10 02:30:45,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (1/1) ... [2019-09-10 02:30:45,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (1/1) ... [2019-09-10 02:30:45,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (1/1) ... [2019-09-10 02:30:45,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (1/1) ... [2019-09-10 02:30:45,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (1/1) ... [2019-09-10 02:30:45,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:30:45,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:30:45,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:30:45,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:30:45,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:30:45,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:30:45,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:30:45,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:30:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-10 02:30:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:30:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:30:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:30:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:30:45,768 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:30:45,768 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:30:45,768 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:30:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:30:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:30:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:30:45,770 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:30:45,771 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:30:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:30:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:30:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:30:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:30:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:30:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:30:45,773 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:30:45,773 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:30:45,773 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:30:45,774 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:30:45,774 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:30:45,774 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:30:45,774 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:30:45,774 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:30:45,775 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:30:45,775 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:30:45,775 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:30:45,775 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:30:45,775 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:30:45,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:30:45,776 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:30:45,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:30:45,776 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:30:45,776 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:30:45,777 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:30:45,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-09-10 02:30:45,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-09-10 02:30:45,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:30:45,777 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-09-10 02:30:45,777 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-09-10 02:30:45,777 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:30:45,778 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-09-10 02:30:45,778 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-09-10 02:30:45,778 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-09-10 02:30:45,778 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-09-10 02:30:45,778 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:30:45,778 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:30:45,778 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:30:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:30:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:30:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:30:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:30:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:30:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:30:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:30:45,780 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-09-10 02:30:45,780 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-09-10 02:30:45,780 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-09-10 02:30:45,781 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-09-10 02:30:45,781 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:30:45,781 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:30:45,781 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:30:45,781 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-09-10 02:30:45,782 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-09-10 02:30:45,782 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-09-10 02:30:45,782 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-09-10 02:30:45,782 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:30:45,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:30:45,783 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:30:45,783 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-09-10 02:30:45,783 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-09-10 02:30:45,783 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:30:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-09-10 02:30:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-09-10 02:30:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:30:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:30:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:30:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:30:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:30:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:30:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:30:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:30:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:30:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:30:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:30:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:30:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:30:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:30:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:30:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:30:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:30:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:30:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-10 02:30:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:30:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:30:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:30:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:30:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:30:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:30:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:30:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:30:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:30:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:30:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:30:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:30:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:30:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:30:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:30:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:30:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:30:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:30:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:30:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:30:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:30:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:30:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:30:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:30:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:30:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:30:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:30:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:30:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:30:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:30:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:30:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:30:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:30:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:30:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:30:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:30:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:30:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:30:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:30:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:30:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:30:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:30:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:30:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:30:45,807 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:30:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:30:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:30:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-09-10 02:30:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-09-10 02:30:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-09-10 02:30:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-09-10 02:30:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-09-10 02:30:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-09-10 02:30:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-09-10 02:30:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-09-10 02:30:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:30:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:30:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:30:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:30:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:30:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-09-10 02:30:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-09-10 02:30:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-09-10 02:30:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-09-10 02:30:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:30:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:30:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-09-10 02:30:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-09-10 02:30:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-09-10 02:30:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-09-10 02:30:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:30:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:30:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:30:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-09-10 02:30:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-09-10 02:30:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-09-10 02:30:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:30:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-09-10 02:30:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:30:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:30:45,812 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:30:45,813 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:30:45,813 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:30:45,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:30:45,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:30:45,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:30:45,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:30:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:30:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:30:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:30:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:30:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:30:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:30:45,814 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:30:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:30:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:30:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:30:45,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:30:48,045 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:30:48,045 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:30:48,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:30:48 BoogieIcfgContainer [2019-09-10 02:30:48,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:30:48,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:30:48,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:30:48,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:30:48,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:30:44" (1/3) ... [2019-09-10 02:30:48,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df55a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:30:48, skipping insertion in model container [2019-09-10 02:30:48,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:30:45" (2/3) ... [2019-09-10 02:30:48,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df55a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:30:48, skipping insertion in model container [2019-09-10 02:30:48,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:30:48" (3/3) ... [2019-09-10 02:30:48,055 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_productSimulator.cil.c [2019-09-10 02:30:48,066 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:30:48,075 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:30:48,092 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:30:48,130 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:30:48,130 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:30:48,130 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:30:48,130 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:30:48,130 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:30:48,130 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:30:48,131 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:30:48,131 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:30:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2019-09-10 02:30:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:30:48,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:48,224 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:48,227 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2107990238, now seen corresponding path program 1 times [2019-09-10 02:30:48,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:48,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:48,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:48,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:48,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:48,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:48,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:49,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:49,010 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 6 states. [2019-09-10 02:30:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:49,200 INFO L93 Difference]: Finished difference Result 745 states and 1140 transitions. [2019-09-10 02:30:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:49,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-10 02:30:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:49,234 INFO L225 Difference]: With dead ends: 745 [2019-09-10 02:30:49,234 INFO L226 Difference]: Without dead ends: 726 [2019-09-10 02:30:49,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:30:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-10 02:30:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-09-10 02:30:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-10 02:30:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1115 transitions. [2019-09-10 02:30:49,340 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1115 transitions. Word has length 120 [2019-09-10 02:30:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:49,342 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1115 transitions. [2019-09-10 02:30:49,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1115 transitions. [2019-09-10 02:30:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 02:30:49,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:49,347 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:49,348 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:49,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:49,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2135919125, now seen corresponding path program 1 times [2019-09-10 02:30:49,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:49,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:49,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:49,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:49,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:49,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:49,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:49,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:49,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:49,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:49,625 INFO L87 Difference]: Start difference. First operand 726 states and 1115 transitions. Second operand 4 states. [2019-09-10 02:30:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:49,720 INFO L93 Difference]: Finished difference Result 730 states and 1118 transitions. [2019-09-10 02:30:49,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:30:49,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-10 02:30:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:49,732 INFO L225 Difference]: With dead ends: 730 [2019-09-10 02:30:49,732 INFO L226 Difference]: Without dead ends: 730 [2019-09-10 02:30:49,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:30:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-10 02:30:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-10 02:30:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-10 02:30:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1118 transitions. [2019-09-10 02:30:49,808 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1118 transitions. Word has length 121 [2019-09-10 02:30:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:49,809 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1118 transitions. [2019-09-10 02:30:49,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1118 transitions. [2019-09-10 02:30:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 02:30:49,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:49,812 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:49,812 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:49,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:49,812 INFO L82 PathProgramCache]: Analyzing trace with hash -542373665, now seen corresponding path program 1 times [2019-09-10 02:30:49,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:49,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:49,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:49,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:49,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:50,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:50,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:50,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:50,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:50,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:50,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:50,036 INFO L87 Difference]: Start difference. First operand 730 states and 1118 transitions. Second operand 4 states. [2019-09-10 02:30:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:50,110 INFO L93 Difference]: Finished difference Result 732 states and 1119 transitions. [2019-09-10 02:30:50,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:50,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-10 02:30:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:50,117 INFO L225 Difference]: With dead ends: 732 [2019-09-10 02:30:50,117 INFO L226 Difference]: Without dead ends: 730 [2019-09-10 02:30:50,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:30:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-10 02:30:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-10 02:30:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-10 02:30:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1117 transitions. [2019-09-10 02:30:50,143 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1117 transitions. Word has length 122 [2019-09-10 02:30:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:50,144 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1117 transitions. [2019-09-10 02:30:50,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1117 transitions. [2019-09-10 02:30:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 02:30:50,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:50,147 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:50,147 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2073857327, now seen corresponding path program 1 times [2019-09-10 02:30:50,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:50,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:50,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:50,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:50,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:50,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:50,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:50,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:50,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:50,327 INFO L87 Difference]: Start difference. First operand 730 states and 1117 transitions. Second operand 4 states. [2019-09-10 02:30:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:50,390 INFO L93 Difference]: Finished difference Result 732 states and 1118 transitions. [2019-09-10 02:30:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:50,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-10 02:30:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:50,397 INFO L225 Difference]: With dead ends: 732 [2019-09-10 02:30:50,397 INFO L226 Difference]: Without dead ends: 730 [2019-09-10 02:30:50,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:30:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-10 02:30:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-10 02:30:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-10 02:30:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1116 transitions. [2019-09-10 02:30:50,423 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1116 transitions. Word has length 123 [2019-09-10 02:30:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:50,423 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1116 transitions. [2019-09-10 02:30:50,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1116 transitions. [2019-09-10 02:30:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 02:30:50,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:50,426 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:50,427 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:50,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:50,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1880970907, now seen corresponding path program 1 times [2019-09-10 02:30:50,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:50,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:50,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:50,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:50,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:50,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:50,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:50,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:50,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:50,556 INFO L87 Difference]: Start difference. First operand 730 states and 1116 transitions. Second operand 4 states. [2019-09-10 02:30:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:50,617 INFO L93 Difference]: Finished difference Result 732 states and 1117 transitions. [2019-09-10 02:30:50,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:50,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-10 02:30:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:50,625 INFO L225 Difference]: With dead ends: 732 [2019-09-10 02:30:50,625 INFO L226 Difference]: Without dead ends: 730 [2019-09-10 02:30:50,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:30:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-10 02:30:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-10 02:30:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-10 02:30:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1115 transitions. [2019-09-10 02:30:50,659 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1115 transitions. Word has length 124 [2019-09-10 02:30:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:50,660 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1115 transitions. [2019-09-10 02:30:50,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1115 transitions. [2019-09-10 02:30:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 02:30:50,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:50,663 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:50,664 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash -182191219, now seen corresponding path program 1 times [2019-09-10 02:30:50,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:50,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:50,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:50,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:50,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:50,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:50,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:50,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:50,879 INFO L87 Difference]: Start difference. First operand 730 states and 1115 transitions. Second operand 4 states. [2019-09-10 02:30:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:50,936 INFO L93 Difference]: Finished difference Result 732 states and 1116 transitions. [2019-09-10 02:30:50,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:30:50,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-10 02:30:50,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:50,943 INFO L225 Difference]: With dead ends: 732 [2019-09-10 02:30:50,943 INFO L226 Difference]: Without dead ends: 730 [2019-09-10 02:30:50,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:30:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-10 02:30:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-09-10 02:30:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-10 02:30:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1114 transitions. [2019-09-10 02:30:50,972 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1114 transitions. Word has length 125 [2019-09-10 02:30:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:50,973 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1114 transitions. [2019-09-10 02:30:50,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1114 transitions. [2019-09-10 02:30:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 02:30:50,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:50,976 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:50,976 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash 175506519, now seen corresponding path program 1 times [2019-09-10 02:30:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:50,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:50,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:51,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:51,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:30:51,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:51,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:30:51,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:30:51,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:30:51,208 INFO L87 Difference]: Start difference. First operand 730 states and 1114 transitions. Second operand 11 states. [2019-09-10 02:30:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:51,425 INFO L93 Difference]: Finished difference Result 739 states and 1126 transitions. [2019-09-10 02:30:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:30:51,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2019-09-10 02:30:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:51,431 INFO L225 Difference]: With dead ends: 739 [2019-09-10 02:30:51,431 INFO L226 Difference]: Without dead ends: 739 [2019-09-10 02:30:51,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:30:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-10 02:30:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2019-09-10 02:30:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-09-10 02:30:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1124 transitions. [2019-09-10 02:30:51,460 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1124 transitions. Word has length 126 [2019-09-10 02:30:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:51,460 INFO L475 AbstractCegarLoop]: Abstraction has 737 states and 1124 transitions. [2019-09-10 02:30:51,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:30:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1124 transitions. [2019-09-10 02:30:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 02:30:51,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:51,463 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:51,464 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:51,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1999173578, now seen corresponding path program 1 times [2019-09-10 02:30:51,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:51,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:51,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:51,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:51,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:51,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:51,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:51,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:51,596 INFO L87 Difference]: Start difference. First operand 737 states and 1124 transitions. Second operand 4 states. [2019-09-10 02:30:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:51,706 INFO L93 Difference]: Finished difference Result 735 states and 1119 transitions. [2019-09-10 02:30:51,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:30:51,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 02:30:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:51,713 INFO L225 Difference]: With dead ends: 735 [2019-09-10 02:30:51,714 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 02:30:51,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:30:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 02:30:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-09-10 02:30:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-09-10 02:30:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1117 transitions. [2019-09-10 02:30:51,738 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1117 transitions. Word has length 126 [2019-09-10 02:30:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:51,740 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1117 transitions. [2019-09-10 02:30:51,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1117 transitions. [2019-09-10 02:30:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 02:30:51,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:51,743 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:51,744 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1624055113, now seen corresponding path program 1 times [2019-09-10 02:30:51,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:51,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:51,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:51,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:51,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:51,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:51,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:51,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:51,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:51,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:51,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:51,878 INFO L87 Difference]: Start difference. First operand 733 states and 1117 transitions. Second operand 6 states. [2019-09-10 02:30:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:52,161 INFO L93 Difference]: Finished difference Result 750 states and 1138 transitions. [2019-09-10 02:30:52,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:30:52,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 02:30:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:52,167 INFO L225 Difference]: With dead ends: 750 [2019-09-10 02:30:52,167 INFO L226 Difference]: Without dead ends: 741 [2019-09-10 02:30:52,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-10 02:30:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 738. [2019-09-10 02:30:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-10 02:30:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2019-09-10 02:30:52,195 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 127 [2019-09-10 02:30:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:52,196 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2019-09-10 02:30:52,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2019-09-10 02:30:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:30:52,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:52,198 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:52,198 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1494752762, now seen corresponding path program 1 times [2019-09-10 02:30:52,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:52,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:52,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:52,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:52,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:52,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:52,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:52,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:52,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:52,323 INFO L87 Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand 6 states. [2019-09-10 02:30:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:52,605 INFO L93 Difference]: Finished difference Result 741 states and 1121 transitions. [2019-09-10 02:30:52,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:52,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-10 02:30:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:52,612 INFO L225 Difference]: With dead ends: 741 [2019-09-10 02:30:52,612 INFO L226 Difference]: Without dead ends: 738 [2019-09-10 02:30:52,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-10 02:30:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-10 02:30:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-10 02:30:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2019-09-10 02:30:52,647 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 128 [2019-09-10 02:30:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:52,648 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2019-09-10 02:30:52,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2019-09-10 02:30:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 02:30:52,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:52,653 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:52,653 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:52,654 INFO L82 PathProgramCache]: Analyzing trace with hash 638673006, now seen corresponding path program 1 times [2019-09-10 02:30:52,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:52,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:52,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:52,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:52,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:52,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:52,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:52,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:52,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:52,900 INFO L87 Difference]: Start difference. First operand 738 states and 1114 transitions. Second operand 6 states. [2019-09-10 02:30:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:53,104 INFO L93 Difference]: Finished difference Result 741 states and 1117 transitions. [2019-09-10 02:30:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:53,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 02:30:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:53,112 INFO L225 Difference]: With dead ends: 741 [2019-09-10 02:30:53,112 INFO L226 Difference]: Without dead ends: 738 [2019-09-10 02:30:53,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-10 02:30:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-10 02:30:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-10 02:30:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1110 transitions. [2019-09-10 02:30:53,136 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1110 transitions. Word has length 129 [2019-09-10 02:30:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:53,137 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1110 transitions. [2019-09-10 02:30:53,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1110 transitions. [2019-09-10 02:30:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 02:30:53,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:53,139 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:53,140 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash 805428462, now seen corresponding path program 1 times [2019-09-10 02:30:53,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:53,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:53,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:53,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:53,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:53,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:53,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:30:53,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:53,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:30:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:30:53,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:30:53,273 INFO L87 Difference]: Start difference. First operand 738 states and 1110 transitions. Second operand 7 states. [2019-09-10 02:30:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:53,362 INFO L93 Difference]: Finished difference Result 744 states and 1117 transitions. [2019-09-10 02:30:53,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:30:53,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-09-10 02:30:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:53,371 INFO L225 Difference]: With dead ends: 744 [2019-09-10 02:30:53,372 INFO L226 Difference]: Without dead ends: 720 [2019-09-10 02:30:53,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-09-10 02:30:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 717. [2019-09-10 02:30:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:30:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1073 transitions. [2019-09-10 02:30:53,403 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1073 transitions. Word has length 129 [2019-09-10 02:30:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:53,403 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1073 transitions. [2019-09-10 02:30:53,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:30:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1073 transitions. [2019-09-10 02:30:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:30:53,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:53,409 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:53,409 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:53,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1272669825, now seen corresponding path program 1 times [2019-09-10 02:30:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:53,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:53,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:53,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:53,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:53,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:53,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:53,571 INFO L87 Difference]: Start difference. First operand 717 states and 1073 transitions. Second operand 6 states. [2019-09-10 02:30:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:53,708 INFO L93 Difference]: Finished difference Result 720 states and 1076 transitions. [2019-09-10 02:30:53,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:53,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-10 02:30:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:53,715 INFO L225 Difference]: With dead ends: 720 [2019-09-10 02:30:53,715 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 02:30:53,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 02:30:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-10 02:30:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:30:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1072 transitions. [2019-09-10 02:30:53,737 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1072 transitions. Word has length 130 [2019-09-10 02:30:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:53,738 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1072 transitions. [2019-09-10 02:30:53,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1072 transitions. [2019-09-10 02:30:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:30:53,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:53,740 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:53,740 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1537429613, now seen corresponding path program 1 times [2019-09-10 02:30:53,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:53,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:53,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:53,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:53,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:30:53,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:53,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:30:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:30:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:53,861 INFO L87 Difference]: Start difference. First operand 717 states and 1072 transitions. Second operand 6 states. [2019-09-10 02:30:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:53,994 INFO L93 Difference]: Finished difference Result 720 states and 1075 transitions. [2019-09-10 02:30:53,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:53,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-10 02:30:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:54,002 INFO L225 Difference]: With dead ends: 720 [2019-09-10 02:30:54,002 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 02:30:54,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:30:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 02:30:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-10 02:30:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:30:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1071 transitions. [2019-09-10 02:30:54,024 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1071 transitions. Word has length 131 [2019-09-10 02:30:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:54,024 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1071 transitions. [2019-09-10 02:30:54,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:30:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1071 transitions. [2019-09-10 02:30:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:30:54,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:54,027 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:54,027 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1036805370, now seen corresponding path program 1 times [2019-09-10 02:30:54,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:54,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:54,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:54,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:54,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:54,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:54,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:30:54,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:54,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:30:54,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:30:54,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:30:54,144 INFO L87 Difference]: Start difference. First operand 717 states and 1071 transitions. Second operand 4 states. [2019-09-10 02:30:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:54,209 INFO L93 Difference]: Finished difference Result 720 states and 1074 transitions. [2019-09-10 02:30:54,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:30:54,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-10 02:30:54,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:54,215 INFO L225 Difference]: With dead ends: 720 [2019-09-10 02:30:54,215 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 02:30:54,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:30:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 02:30:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-10 02:30:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:30:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1070 transitions. [2019-09-10 02:30:54,236 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1070 transitions. Word has length 132 [2019-09-10 02:30:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:54,237 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1070 transitions. [2019-09-10 02:30:54,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:30:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1070 transitions. [2019-09-10 02:30:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:30:54,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:54,240 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:54,240 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:54,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1997244676, now seen corresponding path program 1 times [2019-09-10 02:30:54,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:54,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:54,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:54,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:54,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:54,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:30:54,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:54,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:30:54,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:30:54,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:30:54,434 INFO L87 Difference]: Start difference. First operand 717 states and 1070 transitions. Second operand 13 states. [2019-09-10 02:30:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:54,737 INFO L93 Difference]: Finished difference Result 726 states and 1080 transitions. [2019-09-10 02:30:54,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:30:54,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-09-10 02:30:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:54,743 INFO L225 Difference]: With dead ends: 726 [2019-09-10 02:30:54,743 INFO L226 Difference]: Without dead ends: 724 [2019-09-10 02:30:54,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:30:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-10 02:30:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 722. [2019-09-10 02:30:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-09-10 02:30:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1076 transitions. [2019-09-10 02:30:54,767 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1076 transitions. Word has length 132 [2019-09-10 02:30:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:54,768 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 1076 transitions. [2019-09-10 02:30:54,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:30:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1076 transitions. [2019-09-10 02:30:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:30:54,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:54,773 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:54,773 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2064235796, now seen corresponding path program 1 times [2019-09-10 02:30:54,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:54,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:54,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:54,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:54,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:54,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:30:54,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:54,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:30:54,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:30:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:30:54,880 INFO L87 Difference]: Start difference. First operand 722 states and 1076 transitions. Second operand 3 states. [2019-09-10 02:30:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:54,935 INFO L93 Difference]: Finished difference Result 1391 states and 2091 transitions. [2019-09-10 02:30:54,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:30:54,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-10 02:30:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:54,948 INFO L225 Difference]: With dead ends: 1391 [2019-09-10 02:30:54,949 INFO L226 Difference]: Without dead ends: 1391 [2019-09-10 02:30:54,950 INFO L628 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-09-10 02:30:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-09-10 02:30:54,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2019-09-10 02:30:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-09-10 02:30:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2089 transitions. [2019-09-10 02:30:55,000 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2089 transitions. Word has length 133 [2019-09-10 02:30:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:55,001 INFO L475 AbstractCegarLoop]: Abstraction has 1388 states and 2089 transitions. [2019-09-10 02:30:55,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:30:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2089 transitions. [2019-09-10 02:30:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:30:55,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:55,005 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:55,005 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash 565322765, now seen corresponding path program 1 times [2019-09-10 02:30:55,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:55,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:55,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:30:55,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:55,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:30:55,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:55,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:30:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:30:55,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:30:55,292 INFO L87 Difference]: Start difference. First operand 1388 states and 2089 transitions. Second operand 5 states. [2019-09-10 02:30:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:58,830 INFO L93 Difference]: Finished difference Result 2900 states and 4549 transitions. [2019-09-10 02:30:58,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:30:58,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-10 02:30:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:58,851 INFO L225 Difference]: With dead ends: 2900 [2019-09-10 02:30:58,851 INFO L226 Difference]: Without dead ends: 2900 [2019-09-10 02:30:58,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:30:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2019-09-10 02:30:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2797. [2019-09-10 02:30:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-09-10 02:30:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4393 transitions. [2019-09-10 02:30:58,943 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4393 transitions. Word has length 134 [2019-09-10 02:30:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:58,943 INFO L475 AbstractCegarLoop]: Abstraction has 2797 states and 4393 transitions. [2019-09-10 02:30:58,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:30:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4393 transitions. [2019-09-10 02:30:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 02:30:58,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:58,953 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:58,953 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:58,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1531506531, now seen corresponding path program 1 times [2019-09-10 02:30:58,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:58,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:58,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:58,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:30:59,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:59,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:30:59,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:59,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:30:59,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:30:59,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:30:59,070 INFO L87 Difference]: Start difference. First operand 2797 states and 4393 transitions. Second operand 3 states. [2019-09-10 02:30:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:30:59,183 INFO L93 Difference]: Finished difference Result 2800 states and 4369 transitions. [2019-09-10 02:30:59,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:30:59,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 02:30:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:30:59,206 INFO L225 Difference]: With dead ends: 2800 [2019-09-10 02:30:59,206 INFO L226 Difference]: Without dead ends: 2800 [2019-09-10 02:30:59,207 INFO L628 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-09-10 02:30:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-09-10 02:30:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2797. [2019-09-10 02:30:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-09-10 02:30:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4367 transitions. [2019-09-10 02:30:59,323 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4367 transitions. Word has length 180 [2019-09-10 02:30:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:30:59,324 INFO L475 AbstractCegarLoop]: Abstraction has 2797 states and 4367 transitions. [2019-09-10 02:30:59,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:30:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4367 transitions. [2019-09-10 02:30:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 02:30:59,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:30:59,338 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:30:59,339 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:30:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:30:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1763835588, now seen corresponding path program 1 times [2019-09-10 02:30:59,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:30:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:59,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:30:59,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:30:59,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:30:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:30:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:30:59,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:30:59,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:30:59,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:30:59,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:30:59,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:30:59,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:30:59,681 INFO L87 Difference]: Start difference. First operand 2797 states and 4367 transitions. Second operand 9 states. [2019-09-10 02:31:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:01,210 INFO L93 Difference]: Finished difference Result 2784 states and 4337 transitions. [2019-09-10 02:31:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:31:01,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-09-10 02:31:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:01,231 INFO L225 Difference]: With dead ends: 2784 [2019-09-10 02:31:01,231 INFO L226 Difference]: Without dead ends: 2784 [2019-09-10 02:31:01,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:31:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-09-10 02:31:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2019-09-10 02:31:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-09-10 02:31:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4337 transitions. [2019-09-10 02:31:01,323 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4337 transitions. Word has length 179 [2019-09-10 02:31:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:01,323 INFO L475 AbstractCegarLoop]: Abstraction has 2784 states and 4337 transitions. [2019-09-10 02:31:01,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:31:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4337 transitions. [2019-09-10 02:31:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 02:31:01,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:01,334 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:01,334 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash -485595940, now seen corresponding path program 1 times [2019-09-10 02:31:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:01,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:01,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-10 02:31:01,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:31:01,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:31:01,477 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2019-09-10 02:31:01,480 INFO L207 CegarAbsIntRunner]: [231], [233], [235], [270], [272], [274], [276], [278], [279], [280], [283], [285], [289], [708], [859], [860], [861], [862], [863], [865], [868], [870], [876], [880], [938], [940], [943], [945], [947], [952], [954], [957], [1021], [1022], [1263], [1266], [1275], [1284], [1294], [1295], [1368], [1372], [1375], [1410], [1412], [1413], [1430], [1432], [1529], [1532], [1537], [1540], [1558], [1599], [1601], [1604], [1606], [1610], [1627], [1628], [1629], [1677], [1678], [1746], [1749], [1751], [1755], [1756], [1792], [1795], [1800], [1805], [1810], [1815], [1820], [1823], [1939], [1958], [1963], [1966], [1985], [2172], [2176], [2180], [2184], [2188], [2192], [2195], [2197], [2198], [2211], [2214], [2220], [2224], [2269], [2270], [2469], [2487], [2490], [2508], [2534], [2535], [2536], [2537], [2566], [2567], [2568], [2569], [2570], [2571], [2572], [2573], [2574], [2575], [2576], [2577], [2632], [2633], [2634], [2664], [2665], [2666], [2667], [2692], [2693], [2694], [2695], [2696], [2697], [2698], [2699], [2700], [2822], [2823], [2824], [2825], [2826], [2827], [2828], [2829], [2830], [2836], [2837], [2842], [2843], [2844], [2850], [2851], [2880], [2881], [2882], [2883], [2902], [2903], [2904], [2905], [2922], [2923], [2926], [2927], [2932], [2938], [2960], [2961], [2962] [2019-09-10 02:31:01,565 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:31:01,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:31:01,692 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:31:01,693 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 201 root evaluator evaluations with a maximum evaluation depth of 0. Performed 201 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 274 variables. [2019-09-10 02:31:01,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:01,698 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:31:01,767 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:31:01,767 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:31:01,772 INFO L420 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2019-09-10 02:31:01,772 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:31:01,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:31:01,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:31:01,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:01,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:31:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:31:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:31:01,775 INFO L87 Difference]: Start difference. First operand 2784 states and 4337 transitions. Second operand 2 states. [2019-09-10 02:31:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:01,775 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:31:01,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:31:01,775 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 193 [2019-09-10 02:31:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:01,776 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:31:01,776 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:31:01,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:31:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:31:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:31:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:31:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:31:01,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2019-09-10 02:31:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:01,777 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:31:01,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:31:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:31:01,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:31:01,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:31:01 BoogieIcfgContainer [2019-09-10 02:31:01,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:31:01,786 INFO L168 Benchmark]: Toolchain (without parser) took 17405.31 ms. Allocated memory was 134.7 MB in the beginning and 574.1 MB in the end (delta: 439.4 MB). Free memory was 87.9 MB in the beginning and 123.1 MB in the end (delta: -35.2 MB). Peak memory consumption was 404.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:01,787 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:31:01,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1078.64 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 87.7 MB in the beginning and 131.9 MB in the end (delta: -44.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:01,788 INFO L168 Benchmark]: Boogie Preprocessor took 232.48 ms. Allocated memory is still 201.9 MB. Free memory was 131.9 MB in the beginning and 122.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:01,789 INFO L168 Benchmark]: RCFGBuilder took 2351.43 ms. Allocated memory was 201.9 MB in the beginning and 260.6 MB in the end (delta: 58.7 MB). Free memory was 122.0 MB in the beginning and 119.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:01,790 INFO L168 Benchmark]: TraceAbstraction took 13734.75 ms. Allocated memory was 260.6 MB in the beginning and 574.1 MB in the end (delta: 313.5 MB). Free memory was 119.2 MB in the beginning and 123.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 309.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:01,794 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1078.64 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 87.7 MB in the beginning and 131.9 MB in the end (delta: -44.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 232.48 ms. Allocated memory is still 201.9 MB. Free memory was 131.9 MB in the beginning and 122.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2351.43 ms. Allocated memory was 201.9 MB in the beginning and 260.6 MB in the end (delta: 58.7 MB). Free memory was 122.0 MB in the beginning and 119.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13734.75 ms. Allocated memory was 260.6 MB in the beginning and 574.1 MB in the end (delta: 313.5 MB). Free memory was 119.2 MB in the beginning and 123.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 309.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3631]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 91 procedures, 1013 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 7.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22685 SDtfs, 5431 SDslu, 73769 SDs, 0 SdLazy, 5039 SolverSat, 273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2797occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.5520833333333333 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2844 NumberOfCodeBlocks, 2844 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2823 ConstructedInterpolants, 0 QuantifiedInterpolants, 498359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 716/728 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...