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_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:39:30,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:39:30,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:39:30,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:39:30,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:39:30,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:39:30,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:39:30,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:39:30,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:39:30,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:39:30,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:39:30,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:39:30,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:39:30,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:39:30,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:39:30,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:39:30,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:39:30,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:39:30,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:39:30,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:39:30,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:39:30,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:39:30,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:39:30,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:39:30,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:39:30,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:39:30,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:39:30,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:39:30,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:39:30,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:39:30,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:39:30,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:39:30,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:39:30,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:39:30,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:39:30,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:39:30,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:39:30,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:39:30,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:39:30,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:39:30,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:39:30,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:39:30,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:39:30,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:39:30,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:39:30,249 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:39:30,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:39:30,249 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:39:30,250 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:39:30,250 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:39:30,250 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:39:30,250 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:39:30,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:39:30,251 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:39:30,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:39:30,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:39:30,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:39:30,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:39:30,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:39:30,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:39:30,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:39:30,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:39:30,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:39:30,253 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:39:30,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:39:30,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:39:30,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:39:30,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:39:30,254 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:39:30,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:39:30,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:39:30,255 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:39:30,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:39:30,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:39:30,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:39:30,319 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:39:30,320 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:39:30,320 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product20.cil.c [2019-10-03 02:39:30,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63a0e7e5/36e3633687d54e939b6c4784971dca51/FLAGd7fde206f [2019-10-03 02:39:31,040 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:39:31,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product20.cil.c [2019-10-03 02:39:31,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63a0e7e5/36e3633687d54e939b6c4784971dca51/FLAGd7fde206f [2019-10-03 02:39:31,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63a0e7e5/36e3633687d54e939b6c4784971dca51 [2019-10-03 02:39:31,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:39:31,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:39:31,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:31,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:39:31,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:39:31,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:31" (1/1) ... [2019-10-03 02:39:31,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba36926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:31, skipping insertion in model container [2019-10-03 02:39:31,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:31" (1/1) ... [2019-10-03 02:39:31,293 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:39:31,387 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:39:32,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:32,142 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:39:32,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:32,385 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:39:32,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32 WrapperNode [2019-10-03 02:39:32,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:32,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:39:32,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:39:32,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:39:32,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (1/1) ... [2019-10-03 02:39:32,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (1/1) ... [2019-10-03 02:39:32,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (1/1) ... [2019-10-03 02:39:32,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (1/1) ... [2019-10-03 02:39:32,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (1/1) ... [2019-10-03 02:39:32,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (1/1) ... [2019-10-03 02:39:32,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (1/1) ... [2019-10-03 02:39:32,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:39:32,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:39:32,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:39:32,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:39:32,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:39:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:39:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:39:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:32,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:39:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:39:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:39:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:39:32,691 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:39:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:39:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:39:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:39:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:39:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:39:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:39:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:39:32,695 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:39:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:39:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:39:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:39:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:39:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:39:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:39:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:39:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:39:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:39:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:39:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:39:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:39:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:39:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:39:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:39:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:39:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:39:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:39:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:39:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:39:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:39:32,700 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:39:32,700 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:39:32,700 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:39:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:39:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:39:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:39:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:39:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:39:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:39:32,701 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:39:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:39:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:39:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:39:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:39:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:39:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:39:32,703 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:39:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:39:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:39:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:39:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:39:32,705 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:39:32,705 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:32,706 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:39:32,706 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:39:32,707 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-03 02:39:32,707 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:39:32,707 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-03 02:39:32,707 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:39:32,708 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:39:32,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:39:32,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:39:32,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:39:32,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:39:32,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:39:32,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:39:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:39:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:39:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:39:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:39:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:39:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:32,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:39:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:39:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:39:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:39:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:39:32,717 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:39:32,717 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:39:32,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:39:32,717 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:39:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:39:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:39:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:39:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:39:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:39:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:39:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:39:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:39:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:39:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:39:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:39:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:39:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:39:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:39:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:32,721 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:39:32,721 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:39:32,721 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:39:32,721 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:39:32,722 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:39:32,723 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:39:32,723 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:39:32,723 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:39:32,724 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:39:32,724 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:39:32,724 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:39:32,725 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:39:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:39:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:39:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:39:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:39:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:39:32,727 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:39:32,727 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:39:32,727 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:39:32,728 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:39:32,728 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:39:32,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:39:32,728 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:39:32,728 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:39:32,729 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:39:32,729 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:39:32,730 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:39:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:39:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:39:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:39:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:39:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:39:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:39:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:39:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:39:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:39:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:39:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:39:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:39:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:39:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:39:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:39:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:39:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:39:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:39:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:39:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:39:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:39:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:39:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:39:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-03 02:39:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-03 02:39:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:39:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:39:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:39:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:39:35,196 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:39:35,197 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:39:35,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:35 BoogieIcfgContainer [2019-10-03 02:39:35,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:39:35,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:39:35,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:39:35,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:39:35,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:39:31" (1/3) ... [2019-10-03 02:39:35,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f805c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:35, skipping insertion in model container [2019-10-03 02:39:35,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:32" (2/3) ... [2019-10-03 02:39:35,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f805c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:35, skipping insertion in model container [2019-10-03 02:39:35,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:35" (3/3) ... [2019-10-03 02:39:35,211 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product20.cil.c [2019-10-03 02:39:35,224 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:39:35,235 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:39:35,254 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:39:35,281 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:39:35,281 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:39:35,281 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:39:35,281 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:39:35,281 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:39:35,281 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:39:35,282 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:39:35,282 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:39:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states. [2019-10-03 02:39:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:39:35,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:35,330 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:35,333 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash -570931917, now seen corresponding path program 1 times [2019-10-03 02:39:35,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:35,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:35,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:35,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:35,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:35,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:35,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:35,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:35,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:35,997 INFO L87 Difference]: Start difference. First operand 751 states. Second operand 4 states. [2019-10-03 02:39:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:36,214 INFO L93 Difference]: Finished difference Result 607 states and 955 transitions. [2019-10-03 02:39:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:36,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-03 02:39:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:36,242 INFO L225 Difference]: With dead ends: 607 [2019-10-03 02:39:36,242 INFO L226 Difference]: Without dead ends: 596 [2019-10-03 02:39:36,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-03 02:39:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-03 02:39:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-03 02:39:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 941 transitions. [2019-10-03 02:39:36,401 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 941 transitions. Word has length 87 [2019-10-03 02:39:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:36,402 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 941 transitions. [2019-10-03 02:39:36,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 941 transitions. [2019-10-03 02:39:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:39:36,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:36,408 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:36,408 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:36,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:36,409 INFO L82 PathProgramCache]: Analyzing trace with hash 801065692, now seen corresponding path program 1 times [2019-10-03 02:39:36,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:36,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:36,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:36,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:36,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:36,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:36,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:36,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:36,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:36,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:36,606 INFO L87 Difference]: Start difference. First operand 596 states and 941 transitions. Second operand 4 states. [2019-10-03 02:39:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:36,680 INFO L93 Difference]: Finished difference Result 598 states and 942 transitions. [2019-10-03 02:39:36,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:36,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-03 02:39:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:36,688 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:39:36,688 INFO L226 Difference]: Without dead ends: 596 [2019-10-03 02:39:36,689 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-03 02:39:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-03 02:39:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-03 02:39:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 940 transitions. [2019-10-03 02:39:36,735 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 940 transitions. Word has length 88 [2019-10-03 02:39:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:36,736 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 940 transitions. [2019-10-03 02:39:36,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 940 transitions. [2019-10-03 02:39:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 02:39:36,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:36,747 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:36,750 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash 786966479, now seen corresponding path program 1 times [2019-10-03 02:39:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:36,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:36,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:36,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:36,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:36,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:36,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:36,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:36,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:36,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:36,882 INFO L87 Difference]: Start difference. First operand 596 states and 940 transitions. Second operand 4 states. [2019-10-03 02:39:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:36,977 INFO L93 Difference]: Finished difference Result 598 states and 941 transitions. [2019-10-03 02:39:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:36,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-03 02:39:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:36,987 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:39:36,987 INFO L226 Difference]: Without dead ends: 596 [2019-10-03 02:39:36,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-03 02:39:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-03 02:39:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-03 02:39:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 939 transitions. [2019-10-03 02:39:37,032 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 939 transitions. Word has length 89 [2019-10-03 02:39:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:37,032 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 939 transitions. [2019-10-03 02:39:37,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 939 transitions. [2019-10-03 02:39:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:39:37,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:37,034 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:37,035 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:37,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:37,035 INFO L82 PathProgramCache]: Analyzing trace with hash 753538744, now seen corresponding path program 1 times [2019-10-03 02:39:37,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:37,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:37,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:37,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:37,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:37,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:37,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:37,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:37,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:37,222 INFO L87 Difference]: Start difference. First operand 596 states and 939 transitions. Second operand 4 states. [2019-10-03 02:39:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:37,291 INFO L93 Difference]: Finished difference Result 598 states and 940 transitions. [2019-10-03 02:39:37,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:37,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-03 02:39:37,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:37,329 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:39:37,330 INFO L226 Difference]: Without dead ends: 596 [2019-10-03 02:39:37,331 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-03 02:39:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-03 02:39:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-03 02:39:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 938 transitions. [2019-10-03 02:39:37,356 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 938 transitions. Word has length 90 [2019-10-03 02:39:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:37,357 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 938 transitions. [2019-10-03 02:39:37,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 938 transitions. [2019-10-03 02:39:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:39:37,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:37,365 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:37,366 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash 120926827, now seen corresponding path program 1 times [2019-10-03 02:39:37,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:37,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:37,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:37,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:37,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:37,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:37,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:37,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:37,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:37,513 INFO L87 Difference]: Start difference. First operand 596 states and 938 transitions. Second operand 4 states. [2019-10-03 02:39:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:37,586 INFO L93 Difference]: Finished difference Result 598 states and 939 transitions. [2019-10-03 02:39:37,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:37,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:39:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:37,592 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:39:37,593 INFO L226 Difference]: Without dead ends: 596 [2019-10-03 02:39:37,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-03 02:39:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-03 02:39:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-03 02:39:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 937 transitions. [2019-10-03 02:39:37,616 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 937 transitions. Word has length 91 [2019-10-03 02:39:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:37,617 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 937 transitions. [2019-10-03 02:39:37,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 937 transitions. [2019-10-03 02:39:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:39:37,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:37,620 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:37,620 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1906525548, now seen corresponding path program 1 times [2019-10-03 02:39:37,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:37,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:37,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:37,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:39:37,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:37,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:39:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:39:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:39:37,828 INFO L87 Difference]: Start difference. First operand 596 states and 937 transitions. Second operand 10 states. [2019-10-03 02:39:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:38,003 INFO L93 Difference]: Finished difference Result 605 states and 949 transitions. [2019-10-03 02:39:38,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:39:38,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-03 02:39:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:38,010 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:39:38,010 INFO L226 Difference]: Without dead ends: 605 [2019-10-03 02:39:38,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:39:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-03 02:39:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-10-03 02:39:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-03 02:39:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 947 transitions. [2019-10-03 02:39:38,048 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 947 transitions. Word has length 92 [2019-10-03 02:39:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:38,049 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 947 transitions. [2019-10-03 02:39:38,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:39:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 947 transitions. [2019-10-03 02:39:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:39:38,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:38,053 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:38,053 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1805613581, now seen corresponding path program 1 times [2019-10-03 02:39:38,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:38,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:38,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:38,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:38,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:38,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:38,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:38,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:38,179 INFO L87 Difference]: Start difference. First operand 603 states and 947 transitions. Second operand 4 states. [2019-10-03 02:39:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:38,243 INFO L93 Difference]: Finished difference Result 601 states and 942 transitions. [2019-10-03 02:39:38,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:38,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:39:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:38,251 INFO L225 Difference]: With dead ends: 601 [2019-10-03 02:39:38,251 INFO L226 Difference]: Without dead ends: 599 [2019-10-03 02:39:38,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-03 02:39:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-03 02:39:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-03 02:39:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 940 transitions. [2019-10-03 02:39:38,285 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 940 transitions. Word has length 92 [2019-10-03 02:39:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:38,285 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 940 transitions. [2019-10-03 02:39:38,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 940 transitions. [2019-10-03 02:39:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:39:38,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:38,290 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:38,290 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:38,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash -940394859, now seen corresponding path program 1 times [2019-10-03 02:39:38,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:38,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:38,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:38,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:38,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:38,539 INFO L87 Difference]: Start difference. First operand 599 states and 940 transitions. Second operand 6 states. [2019-10-03 02:39:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:38,870 INFO L93 Difference]: Finished difference Result 616 states and 961 transitions. [2019-10-03 02:39:38,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:39:38,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-03 02:39:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:38,876 INFO L225 Difference]: With dead ends: 616 [2019-10-03 02:39:38,876 INFO L226 Difference]: Without dead ends: 607 [2019-10-03 02:39:38,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-03 02:39:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-10-03 02:39:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-03 02:39:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 941 transitions. [2019-10-03 02:39:38,899 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 941 transitions. Word has length 93 [2019-10-03 02:39:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:38,900 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 941 transitions. [2019-10-03 02:39:38,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 941 transitions. [2019-10-03 02:39:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:39:38,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:38,902 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:38,902 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash 101605271, now seen corresponding path program 1 times [2019-10-03 02:39:38,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:38,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:38,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:39,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:39,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:39,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:39,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:39,038 INFO L87 Difference]: Start difference. First operand 604 states and 941 transitions. Second operand 6 states. [2019-10-03 02:39:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:39,278 INFO L93 Difference]: Finished difference Result 607 states and 944 transitions. [2019-10-03 02:39:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:39,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-03 02:39:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:39,286 INFO L225 Difference]: With dead ends: 607 [2019-10-03 02:39:39,286 INFO L226 Difference]: Without dead ends: 604 [2019-10-03 02:39:39,288 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-03 02:39:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-03 02:39:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-03 02:39:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 937 transitions. [2019-10-03 02:39:39,309 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 937 transitions. Word has length 94 [2019-10-03 02:39:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:39,309 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 937 transitions. [2019-10-03 02:39:39,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 937 transitions. [2019-10-03 02:39:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:39:39,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:39,312 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:39,312 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:39,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1301106266, now seen corresponding path program 1 times [2019-10-03 02:39:39,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:39,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:39,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:39,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:39,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:39,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:39,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:39,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:39,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:39,471 INFO L87 Difference]: Start difference. First operand 604 states and 937 transitions. Second operand 6 states. [2019-10-03 02:39:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:39,780 INFO L93 Difference]: Finished difference Result 607 states and 940 transitions. [2019-10-03 02:39:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:39,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 02:39:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:39,788 INFO L225 Difference]: With dead ends: 607 [2019-10-03 02:39:39,788 INFO L226 Difference]: Without dead ends: 604 [2019-10-03 02:39:39,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-03 02:39:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-03 02:39:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-03 02:39:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 933 transitions. [2019-10-03 02:39:39,821 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 933 transitions. Word has length 95 [2019-10-03 02:39:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:39,822 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 933 transitions. [2019-10-03 02:39:39,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 933 transitions. [2019-10-03 02:39:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:39:39,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:39,825 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:39,826 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 405801690, now seen corresponding path program 1 times [2019-10-03 02:39:39,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:39,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:40,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:40,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:39:40,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:40,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:39:40,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:39:40,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:39:40,068 INFO L87 Difference]: Start difference. First operand 604 states and 933 transitions. Second operand 7 states. [2019-10-03 02:39:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:40,215 INFO L93 Difference]: Finished difference Result 610 states and 940 transitions. [2019-10-03 02:39:40,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:39:40,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-03 02:39:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:40,224 INFO L225 Difference]: With dead ends: 610 [2019-10-03 02:39:40,224 INFO L226 Difference]: Without dead ends: 586 [2019-10-03 02:39:40,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-03 02:39:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2019-10-03 02:39:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-03 02:39:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 896 transitions. [2019-10-03 02:39:40,256 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 896 transitions. Word has length 95 [2019-10-03 02:39:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:40,257 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 896 transitions. [2019-10-03 02:39:40,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:39:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 896 transitions. [2019-10-03 02:39:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:39:40,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:40,260 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:40,260 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1206800516, now seen corresponding path program 1 times [2019-10-03 02:39:40,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:40,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:40,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:40,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:40,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:40,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:40,409 INFO L87 Difference]: Start difference. First operand 583 states and 896 transitions. Second operand 6 states. [2019-10-03 02:39:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:40,537 INFO L93 Difference]: Finished difference Result 586 states and 899 transitions. [2019-10-03 02:39:40,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:40,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:39:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:40,543 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:39:40,543 INFO L226 Difference]: Without dead ends: 583 [2019-10-03 02:39:40,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-03 02:39:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-03 02:39:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-03 02:39:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 895 transitions. [2019-10-03 02:39:40,564 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 895 transitions. Word has length 96 [2019-10-03 02:39:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:40,565 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 895 transitions. [2019-10-03 02:39:40,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 895 transitions. [2019-10-03 02:39:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:39:40,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:40,567 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:40,567 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1614735903, now seen corresponding path program 1 times [2019-10-03 02:39:40,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:40,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:40,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:40,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:40,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:40,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:40,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:40,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:40,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:40,694 INFO L87 Difference]: Start difference. First operand 583 states and 895 transitions. Second operand 6 states. [2019-10-03 02:39:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:40,867 INFO L93 Difference]: Finished difference Result 586 states and 898 transitions. [2019-10-03 02:39:40,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:40,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-03 02:39:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:40,874 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:39:40,874 INFO L226 Difference]: Without dead ends: 583 [2019-10-03 02:39:40,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-03 02:39:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-03 02:39:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-03 02:39:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 894 transitions. [2019-10-03 02:39:40,913 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 894 transitions. Word has length 97 [2019-10-03 02:39:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:40,915 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 894 transitions. [2019-10-03 02:39:40,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 894 transitions. [2019-10-03 02:39:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:39:40,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:40,918 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:40,919 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2145287009, now seen corresponding path program 1 times [2019-10-03 02:39:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:41,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:41,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:39:41,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:41,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:39:41,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:39:41,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:39:41,193 INFO L87 Difference]: Start difference. First operand 583 states and 894 transitions. Second operand 12 states. [2019-10-03 02:39:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:41,628 INFO L93 Difference]: Finished difference Result 592 states and 904 transitions. [2019-10-03 02:39:41,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:39:41,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-03 02:39:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:41,633 INFO L225 Difference]: With dead ends: 592 [2019-10-03 02:39:41,634 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 02:39:41,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:39:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 02:39:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-10-03 02:39:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-03 02:39:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 900 transitions. [2019-10-03 02:39:41,655 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 900 transitions. Word has length 98 [2019-10-03 02:39:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:41,657 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 900 transitions. [2019-10-03 02:39:41,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:39:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 900 transitions. [2019-10-03 02:39:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:39:41,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:41,659 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:41,659 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:41,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash 657724894, now seen corresponding path program 1 times [2019-10-03 02:39:41,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:41,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:41,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:41,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:41,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:41,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:41,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:41,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:41,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:41,782 INFO L87 Difference]: Start difference. First operand 588 states and 900 transitions. Second operand 6 states. [2019-10-03 02:39:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:42,559 INFO L93 Difference]: Finished difference Result 592 states and 904 transitions. [2019-10-03 02:39:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:42,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-03 02:39:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:42,564 INFO L225 Difference]: With dead ends: 592 [2019-10-03 02:39:42,564 INFO L226 Difference]: Without dead ends: 592 [2019-10-03 02:39:42,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:39:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-03 02:39:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-03 02:39:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-03 02:39:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 904 transitions. [2019-10-03 02:39:42,593 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 904 transitions. Word has length 99 [2019-10-03 02:39:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:42,593 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 904 transitions. [2019-10-03 02:39:42,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 904 transitions. [2019-10-03 02:39:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 02:39:42,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:42,595 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:42,596 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1162306209, now seen corresponding path program 1 times [2019-10-03 02:39:42,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:42,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:42,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:42,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:42,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:42,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:42,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:42,738 INFO L87 Difference]: Start difference. First operand 592 states and 904 transitions. Second operand 6 states. [2019-10-03 02:39:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:43,595 INFO L93 Difference]: Finished difference Result 597 states and 909 transitions. [2019-10-03 02:39:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:43,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-03 02:39:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:43,600 INFO L225 Difference]: With dead ends: 597 [2019-10-03 02:39:43,600 INFO L226 Difference]: Without dead ends: 597 [2019-10-03 02:39:43,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:39:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-03 02:39:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-03 02:39:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-03 02:39:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 909 transitions. [2019-10-03 02:39:43,619 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 909 transitions. Word has length 100 [2019-10-03 02:39:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:43,619 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 909 transitions. [2019-10-03 02:39:43,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 909 transitions. [2019-10-03 02:39:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:39:43,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:43,621 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:43,622 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2097760514, now seen corresponding path program 1 times [2019-10-03 02:39:43,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:43,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:43,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:43,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:43,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:43,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:43,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:43,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:43,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:43,746 INFO L87 Difference]: Start difference. First operand 597 states and 909 transitions. Second operand 6 states. [2019-10-03 02:39:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:44,432 INFO L93 Difference]: Finished difference Result 603 states and 915 transitions. [2019-10-03 02:39:44,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:44,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-03 02:39:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:44,438 INFO L225 Difference]: With dead ends: 603 [2019-10-03 02:39:44,438 INFO L226 Difference]: Without dead ends: 603 [2019-10-03 02:39:44,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:39:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-03 02:39:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-03 02:39:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-03 02:39:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 915 transitions. [2019-10-03 02:39:44,463 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 915 transitions. Word has length 101 [2019-10-03 02:39:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:44,463 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 915 transitions. [2019-10-03 02:39:44,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 915 transitions. [2019-10-03 02:39:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 02:39:44,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:44,465 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:44,466 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:44,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:44,466 INFO L82 PathProgramCache]: Analyzing trace with hash -367897405, now seen corresponding path program 1 times [2019-10-03 02:39:44,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:44,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:44,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:44,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:44,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:44,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:44,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:44,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:44,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:44,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:44,597 INFO L87 Difference]: Start difference. First operand 603 states and 915 transitions. Second operand 6 states. [2019-10-03 02:39:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:45,290 INFO L93 Difference]: Finished difference Result 610 states and 922 transitions. [2019-10-03 02:39:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:45,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-10-03 02:39:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:45,296 INFO L225 Difference]: With dead ends: 610 [2019-10-03 02:39:45,296 INFO L226 Difference]: Without dead ends: 610 [2019-10-03 02:39:45,296 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:39:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-03 02:39:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-03 02:39:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-03 02:39:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 922 transitions. [2019-10-03 02:39:45,321 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 922 transitions. Word has length 102 [2019-10-03 02:39:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:45,323 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 922 transitions. [2019-10-03 02:39:45,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 922 transitions. [2019-10-03 02:39:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:39:45,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:45,325 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:45,326 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:45,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:45,327 INFO L82 PathProgramCache]: Analyzing trace with hash 57607206, now seen corresponding path program 1 times [2019-10-03 02:39:45,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:45,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:45,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:45,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:39:45,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:45,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:39:45,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:39:45,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:39:45,554 INFO L87 Difference]: Start difference. First operand 610 states and 922 transitions. Second operand 9 states. [2019-10-03 02:39:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:51,887 INFO L93 Difference]: Finished difference Result 1247 states and 1928 transitions. [2019-10-03 02:39:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:39:51,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-10-03 02:39:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:51,897 INFO L225 Difference]: With dead ends: 1247 [2019-10-03 02:39:51,897 INFO L226 Difference]: Without dead ends: 1178 [2019-10-03 02:39:51,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:39:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-10-03 02:39:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1170. [2019-10-03 02:39:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-10-03 02:39:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1817 transitions. [2019-10-03 02:39:51,943 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1817 transitions. Word has length 103 [2019-10-03 02:39:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:51,944 INFO L475 AbstractCegarLoop]: Abstraction has 1170 states and 1817 transitions. [2019-10-03 02:39:51,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:39:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1817 transitions. [2019-10-03 02:39:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 02:39:51,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:51,947 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:51,948 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:51,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1752163743, now seen corresponding path program 1 times [2019-10-03 02:39:51,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:51,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:51,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:51,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:39:52,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:52,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:39:52,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:52,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:39:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:39:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:39:52,107 INFO L87 Difference]: Start difference. First operand 1170 states and 1817 transitions. Second operand 9 states. [2019-10-03 02:39:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:52,319 INFO L93 Difference]: Finished difference Result 1128 states and 1752 transitions. [2019-10-03 02:39:52,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:39:52,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-10-03 02:39:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:52,326 INFO L225 Difference]: With dead ends: 1128 [2019-10-03 02:39:52,326 INFO L226 Difference]: Without dead ends: 1065 [2019-10-03 02:39:52,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:39:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-10-03 02:39:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2019-10-03 02:39:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-10-03 02:39:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1644 transitions. [2019-10-03 02:39:52,362 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1644 transitions. Word has length 106 [2019-10-03 02:39:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:52,363 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1644 transitions. [2019-10-03 02:39:52,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:39:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1644 transitions. [2019-10-03 02:39:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-03 02:39:52,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:52,369 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:52,369 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:52,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash -175364120, now seen corresponding path program 1 times [2019-10-03 02:39:52,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:52,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:52,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 38 proven. 42 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-03 02:39:52,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:52,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:52,610 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2019-10-03 02:39:52,612 INFO L207 CegarAbsIntRunner]: [60], [61], [140], [144], [147], [338], [340], [342], [393], [394], [396], [397], [458], [460], [462], [537], [539], [542], [545], [555], [556], [600], [601], [602], [607], [640], [641], [725], [761], [764], [767], [769], [774], [779], [784], [789], [792], [908], [913], [914], [918], [963], [968], [971], [973], [978], [983], [986], [990], [1175], [1178], [1179], [1183], [1187], [1191], [1195], [1198], [1200], [1243], [1245], [1248], [1250], [1252], [1257], [1259], [1262], [1268], [1270], [1368], [1369], [1645], [1979], [1983], [1987], [1991], [1995], [1998], [2000], [2386], [2387], [2388], [2389], [2390], [2391], [2392], [2393], [2394], [2404], [2405], [2406], [2407], [2432], [2433], [2440], [2441], [2442], [2443], [2444], [2445], [2446], [2447], [2448], [2449], [2450], [2474], [2475], [2480], [2481], [2482], [2508], [2509], [2510], [2511], [2512], [2513], [2514], [2515], [2536], [2542], [2543], [2544], [2545], [2546], [2547], [2548], [2549], [2550], [2596], [2597], [2598] [2019-10-03 02:39:52,668 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:39:52,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:39:52,793 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:39:52,794 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 135 root evaluator evaluations with a maximum evaluation depth of 0. Performed 135 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 260 variables. [2019-10-03 02:39:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:52,799 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:39:52,914 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:39:52,914 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:39:52,926 INFO L420 sIntCurrentIteration]: We unified 225 AI predicates to 225 [2019-10-03 02:39:52,926 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:39:52,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:39:52,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:39:52,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:52,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:39:52,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:39:52,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:52,931 INFO L87 Difference]: Start difference. First operand 1065 states and 1644 transitions. Second operand 2 states. [2019-10-03 02:39:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:52,931 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:39:52,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:39:52,932 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 226 [2019-10-03 02:39:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:52,932 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:39:52,932 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:39:52,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 225 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-10-03 02:39:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:39:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:39:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:39:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:39:52,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2019-10-03 02:39:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:52,934 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:39:52,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:39:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:39:52,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:39:52,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:39:52 BoogieIcfgContainer [2019-10-03 02:39:52,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:39:52,952 INFO L168 Benchmark]: Toolchain (without parser) took 21670.58 ms. Allocated memory was 132.6 MB in the beginning and 590.3 MB in the end (delta: 457.7 MB). Free memory was 84.0 MB in the beginning and 362.1 MB in the end (delta: -278.2 MB). Peak memory consumption was 179.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:52,953 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:39:52,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1109.17 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 83.8 MB in the beginning and 138.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:52,954 INFO L168 Benchmark]: Boogie Preprocessor took 201.35 ms. Allocated memory is still 200.8 MB. Free memory was 138.3 MB in the beginning and 128.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:52,956 INFO L168 Benchmark]: RCFGBuilder took 2611.48 ms. Allocated memory was 200.8 MB in the beginning and 267.9 MB in the end (delta: 67.1 MB). Free memory was 128.9 MB in the beginning and 150.6 MB in the end (delta: -21.7 MB). Peak memory consumption was 90.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:52,959 INFO L168 Benchmark]: TraceAbstraction took 17740.91 ms. Allocated memory was 267.9 MB in the beginning and 590.3 MB in the end (delta: 322.4 MB). Free memory was 150.6 MB in the beginning and 362.1 MB in the end (delta: -211.6 MB). Peak memory consumption was 110.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:52,969 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.22 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1109.17 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 83.8 MB in the beginning and 138.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 201.35 ms. Allocated memory is still 200.8 MB. Free memory was 138.3 MB in the beginning and 128.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2611.48 ms. Allocated memory was 200.8 MB in the beginning and 267.9 MB in the end (delta: 67.1 MB). Free memory was 128.9 MB in the beginning and 150.6 MB in the end (delta: -21.7 MB). Peak memory consumption was 90.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17740.91 ms. Allocated memory was 267.9 MB in the beginning and 590.3 MB in the end (delta: 322.4 MB). Free memory was 150.6 MB in the beginning and 362.1 MB in the end (delta: -211.6 MB). Peak memory consumption was 110.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3310]: 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 77 procedures, 894 locations, 1 error locations. SAFE Result, 17.6s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17703 SDtfs, 5916 SDslu, 65469 SDs, 0 SdLazy, 8353 SolverSat, 702 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1170occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.1822222222222223 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2134 NumberOfCodeBlocks, 2134 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2113 ConstructedInterpolants, 0 QuantifiedInterpolants, 326604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 214/256 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...