java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:35:20,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:35:20,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:35:20,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:35:20,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:35:20,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:35:20,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:35:20,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:35:20,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:35:20,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:35:20,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:35:20,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:35:20,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:35:20,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:35:20,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:35:20,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:35:20,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:35:20,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:35:20,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:35:20,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:35:20,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:35:20,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:35:20,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:35:20,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:35:20,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:35:20,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:35:20,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:35:20,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:35:20,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:35:20,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:35:20,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:35:20,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:35:20,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:35:20,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:35:20,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:35:20,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:35:20,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:35:20,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:35:20,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:35:20,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:35:20,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:35:20,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:35:20,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:35:20,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:35:20,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:35:20,270 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:35:20,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:35:20,270 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:35:20,271 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:35:20,271 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:35:20,271 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:35:20,271 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:35:20,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:35:20,272 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:35:20,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:35:20,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:35:20,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:35:20,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:35:20,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:35:20,273 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:35:20,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:35:20,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:35:20,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:35:20,274 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:35:20,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:35:20,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:35:20,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:35:20,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:35:20,275 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:35:20,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:35:20,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:35:20,276 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:35:20,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:35:20,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:35:20,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:35:20,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:35:20,324 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:35:20,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-09-10 02:35:20,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e82ff26/baa4732cdae94389b3ea7c26d7a662d1/FLAG80f019cdc [2019-09-10 02:35:21,013 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:35:21,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-09-10 02:35:21,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e82ff26/baa4732cdae94389b3ea7c26d7a662d1/FLAG80f019cdc [2019-09-10 02:35:21,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e82ff26/baa4732cdae94389b3ea7c26d7a662d1 [2019-09-10 02:35:21,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:35:21,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:35:21,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:35:21,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:35:21,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:35:21,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:35:21" (1/1) ... [2019-09-10 02:35:21,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d0c57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:21, skipping insertion in model container [2019-09-10 02:35:21,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:35:21" (1/1) ... [2019-09-10 02:35:21,196 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:35:21,278 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:35:21,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:35:21,986 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:35:22,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:35:22,227 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:35:22,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22 WrapperNode [2019-09-10 02:35:22,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:35:22,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:35:22,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:35:22,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:35:22,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (1/1) ... [2019-09-10 02:35:22,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (1/1) ... [2019-09-10 02:35:22,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (1/1) ... [2019-09-10 02:35:22,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (1/1) ... [2019-09-10 02:35:22,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (1/1) ... [2019-09-10 02:35:22,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (1/1) ... [2019-09-10 02:35:22,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (1/1) ... [2019-09-10 02:35:22,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:35:22,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:35:22,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:35:22,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:35:22,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:35:22,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:35:22,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:35:22,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:35:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:35:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:35:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:35:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:35:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:35:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:35:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:35:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:35:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:35:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:35:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:35:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:35:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:35:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:35:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:35:22,495 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:35:22,495 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:35:22,495 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:35:22,495 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:35:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:35:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:35:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:35:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:35:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:35:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:35:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:35:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:35:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:35:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:35:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:35:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:35:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:35:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:35:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:35:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:35:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:35:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:35:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:35:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:35:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:35:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:35:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:35:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:35:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:35:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:35:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:35:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:35:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:35:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:35:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:35:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:35:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:35:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:35:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:35:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:35:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:35:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:35:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:35:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:35:22,502 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:35:22,502 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:35:22,502 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:35:22,502 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:35:22,502 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:35:22,502 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:35:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:35:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:35:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:35:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:35:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:35:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:35:22,504 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:35:22,504 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:35:22,504 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:35:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:35:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:35:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:35:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:35:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:35:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:35:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:35:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:35:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:35:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:35:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:35:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:35:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:35:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:35:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:35:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:35:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:35:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:35:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:35:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:35:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:35:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:35:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:35:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:35:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:35:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:35:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:35:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:35:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:35:22,508 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:35:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:35:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:35:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:35:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:35:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:35:22,509 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:35:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:35:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:35:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:35:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:35:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:35:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:35:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:35:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:35:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:35:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:35:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:35:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:35:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:35:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:35:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:35:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:35:22,512 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:35:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:35:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:35:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:35:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:35:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:35:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:35:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:35:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:35:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:35:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:35:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:35:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:35:22,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:35:22,515 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:35:22,515 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:35:22,515 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:35:22,515 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:35:22,516 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:35:22,516 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:35:22,516 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:35:22,516 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:35:22,516 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:35:22,516 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:35:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:35:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:35:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:35:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:35:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:35:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:35:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:35:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:35:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:35:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:35:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:35:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:35:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:35:22,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:35:22,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:35:22,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:35:24,747 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:35:24,747 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:35:24,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:35:24 BoogieIcfgContainer [2019-09-10 02:35:24,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:35:24,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:35:24,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:35:24,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:35:24,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:35:21" (1/3) ... [2019-09-10 02:35:24,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50839f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:35:24, skipping insertion in model container [2019-09-10 02:35:24,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:22" (2/3) ... [2019-09-10 02:35:24,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50839f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:35:24, skipping insertion in model container [2019-09-10 02:35:24,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:35:24" (3/3) ... [2019-09-10 02:35:24,757 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2019-09-10 02:35:24,767 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:35:24,779 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:35:24,794 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:35:24,818 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:35:24,818 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:35:24,818 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:35:24,818 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:35:24,818 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:35:24,818 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:35:24,819 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:35:24,819 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:35:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states. [2019-09-10 02:35:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 02:35:24,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:24,912 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:24,914 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash 998764860, now seen corresponding path program 1 times [2019-09-10 02:35:24,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:24,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:24,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:24,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:24,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:25,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:25,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:25,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:25,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:25,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:25,599 INFO L87 Difference]: Start difference. First operand 780 states. Second operand 4 states. [2019-09-10 02:35:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:25,785 INFO L93 Difference]: Finished difference Result 631 states and 1000 transitions. [2019-09-10 02:35:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:25,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 02:35:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:25,827 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:35:25,827 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:25,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 988 transitions. [2019-09-10 02:35:25,953 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 988 transitions. Word has length 126 [2019-09-10 02:35:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:25,954 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 988 transitions. [2019-09-10 02:35:25,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 988 transitions. [2019-09-10 02:35:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 02:35:25,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:25,964 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:25,964 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1436115491, now seen corresponding path program 1 times [2019-09-10 02:35:25,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:25,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:25,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:25,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:26,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:26,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:26,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:26,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:26,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:26,233 INFO L87 Difference]: Start difference. First operand 620 states and 988 transitions. Second operand 4 states. [2019-09-10 02:35:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:26,297 INFO L93 Difference]: Finished difference Result 622 states and 989 transitions. [2019-09-10 02:35:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:26,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 02:35:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:26,303 INFO L225 Difference]: With dead ends: 622 [2019-09-10 02:35:26,304 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:26,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 987 transitions. [2019-09-10 02:35:26,338 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 987 transitions. Word has length 129 [2019-09-10 02:35:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:26,340 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 987 transitions. [2019-09-10 02:35:26,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 987 transitions. [2019-09-10 02:35:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:35:26,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:26,351 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:26,360 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1964351121, now seen corresponding path program 1 times [2019-09-10 02:35:26,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:26,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:26,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:26,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:26,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:26,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:26,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:26,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:26,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:26,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:26,652 INFO L87 Difference]: Start difference. First operand 620 states and 987 transitions. Second operand 4 states. [2019-09-10 02:35:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:26,715 INFO L93 Difference]: Finished difference Result 622 states and 988 transitions. [2019-09-10 02:35:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:26,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 02:35:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:26,720 INFO L225 Difference]: With dead ends: 622 [2019-09-10 02:35:26,720 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:26,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 986 transitions. [2019-09-10 02:35:26,743 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 986 transitions. Word has length 130 [2019-09-10 02:35:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:26,743 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 986 transitions. [2019-09-10 02:35:26,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 986 transitions. [2019-09-10 02:35:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:35:26,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:26,749 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:26,749 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2042355745, now seen corresponding path program 1 times [2019-09-10 02:35:26,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:26,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:26,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:26,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:26,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:26,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:26,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:26,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:26,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:26,891 INFO L87 Difference]: Start difference. First operand 620 states and 986 transitions. Second operand 4 states. [2019-09-10 02:35:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:26,941 INFO L93 Difference]: Finished difference Result 622 states and 987 transitions. [2019-09-10 02:35:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:26,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-10 02:35:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:26,946 INFO L225 Difference]: With dead ends: 622 [2019-09-10 02:35:26,946 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:26,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-09-10 02:35:26,968 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 131 [2019-09-10 02:35:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:26,968 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-09-10 02:35:26,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-09-10 02:35:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:35:26,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:26,973 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:26,974 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash 603391923, now seen corresponding path program 1 times [2019-09-10 02:35:26,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:26,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:26,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:27,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:27,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:27,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:27,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:27,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:27,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:27,087 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 4 states. [2019-09-10 02:35:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:27,133 INFO L93 Difference]: Finished difference Result 622 states and 986 transitions. [2019-09-10 02:35:27,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:27,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-10 02:35:27,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:27,138 INFO L225 Difference]: With dead ends: 622 [2019-09-10 02:35:27,138 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:27,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 984 transitions. [2019-09-10 02:35:27,158 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 984 transitions. Word has length 132 [2019-09-10 02:35:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:27,159 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 984 transitions. [2019-09-10 02:35:27,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 984 transitions. [2019-09-10 02:35:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:35:27,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:27,164 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:27,164 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2147328613, now seen corresponding path program 1 times [2019-09-10 02:35:27,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:27,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:27,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:27,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:27,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:27,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:27,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:27,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:27,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:27,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:27,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:27,400 INFO L87 Difference]: Start difference. First operand 620 states and 984 transitions. Second operand 10 states. [2019-09-10 02:35:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:27,582 INFO L93 Difference]: Finished difference Result 629 states and 995 transitions. [2019-09-10 02:35:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:35:27,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2019-09-10 02:35:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:27,591 INFO L225 Difference]: With dead ends: 629 [2019-09-10 02:35:27,592 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:35:27,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:35:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:35:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-09-10 02:35:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-10 02:35:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 993 transitions. [2019-09-10 02:35:27,639 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 993 transitions. Word has length 133 [2019-09-10 02:35:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:27,641 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 993 transitions. [2019-09-10 02:35:27,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 993 transitions. [2019-09-10 02:35:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:35:27,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:27,647 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:27,648 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1347103130, now seen corresponding path program 1 times [2019-09-10 02:35:27,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:27,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:27,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:27,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:27,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:27,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:27,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:27,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:27,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:27,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:27,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:27,793 INFO L87 Difference]: Start difference. First operand 627 states and 993 transitions. Second operand 4 states. [2019-09-10 02:35:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:27,842 INFO L93 Difference]: Finished difference Result 625 states and 988 transitions. [2019-09-10 02:35:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:27,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 02:35:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:27,848 INFO L225 Difference]: With dead ends: 625 [2019-09-10 02:35:27,848 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:35:27,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:35:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-10 02:35:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:35:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 970 transitions. [2019-09-10 02:35:27,870 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 970 transitions. Word has length 133 [2019-09-10 02:35:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:27,872 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 970 transitions. [2019-09-10 02:35:27,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 970 transitions. [2019-09-10 02:35:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:35:27,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:27,878 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:27,878 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:27,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1290451205, now seen corresponding path program 1 times [2019-09-10 02:35:27,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:27,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:28,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:28,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:28,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:28,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:28,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:28,092 INFO L87 Difference]: Start difference. First operand 614 states and 970 transitions. Second operand 6 states. [2019-09-10 02:35:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:28,337 INFO L93 Difference]: Finished difference Result 617 states and 973 transitions. [2019-09-10 02:35:28,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:28,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 02:35:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:28,344 INFO L225 Difference]: With dead ends: 617 [2019-09-10 02:35:28,345 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:35:28,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:35:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-10 02:35:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:35:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 966 transitions. [2019-09-10 02:35:28,370 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 966 transitions. Word has length 134 [2019-09-10 02:35:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:28,370 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 966 transitions. [2019-09-10 02:35:28,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 966 transitions. [2019-09-10 02:35:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:35:28,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:28,376 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:28,376 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1379251042, now seen corresponding path program 1 times [2019-09-10 02:35:28,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:28,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:28,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:28,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:28,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:28,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:28,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:28,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:28,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:28,504 INFO L87 Difference]: Start difference. First operand 614 states and 966 transitions. Second operand 6 states. [2019-09-10 02:35:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:28,712 INFO L93 Difference]: Finished difference Result 617 states and 969 transitions. [2019-09-10 02:35:28,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:28,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-10 02:35:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:28,717 INFO L225 Difference]: With dead ends: 617 [2019-09-10 02:35:28,717 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:35:28,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:35:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-10 02:35:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:35:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 962 transitions. [2019-09-10 02:35:28,736 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 962 transitions. Word has length 135 [2019-09-10 02:35:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:28,737 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 962 transitions. [2019-09-10 02:35:28,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 962 transitions. [2019-09-10 02:35:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:35:28,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:28,742 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:28,742 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash 234769472, now seen corresponding path program 1 times [2019-09-10 02:35:28,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:28,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:28,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:28,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:28,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:28,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:28,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:28,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:28,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:28,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:28,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:28,864 INFO L87 Difference]: Start difference. First operand 614 states and 962 transitions. Second operand 6 states. [2019-09-10 02:35:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:29,046 INFO L93 Difference]: Finished difference Result 617 states and 965 transitions. [2019-09-10 02:35:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:29,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 02:35:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:29,052 INFO L225 Difference]: With dead ends: 617 [2019-09-10 02:35:29,052 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:35:29,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:35:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-10 02:35:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:35:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 958 transitions. [2019-09-10 02:35:29,077 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 958 transitions. Word has length 136 [2019-09-10 02:35:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:29,077 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 958 transitions. [2019-09-10 02:35:29,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 958 transitions. [2019-09-10 02:35:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:35:29,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:29,082 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:29,083 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:29,083 INFO L82 PathProgramCache]: Analyzing trace with hash -185638976, now seen corresponding path program 1 times [2019-09-10 02:35:29,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:29,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:29,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:29,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:29,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:29,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:29,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:29,267 INFO L87 Difference]: Start difference. First operand 614 states and 958 transitions. Second operand 7 states. [2019-09-10 02:35:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:29,349 INFO L93 Difference]: Finished difference Result 617 states and 961 transitions. [2019-09-10 02:35:29,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:35:29,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-09-10 02:35:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:29,354 INFO L225 Difference]: With dead ends: 617 [2019-09-10 02:35:29,354 INFO L226 Difference]: Without dead ends: 593 [2019-09-10 02:35:29,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-10 02:35:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-09-10 02:35:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-10 02:35:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 924 transitions. [2019-09-10 02:35:29,373 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 924 transitions. Word has length 136 [2019-09-10 02:35:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:29,373 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 924 transitions. [2019-09-10 02:35:29,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 924 transitions. [2019-09-10 02:35:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 02:35:29,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:29,378 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:29,378 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash -486730051, now seen corresponding path program 1 times [2019-09-10 02:35:29,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:29,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:29,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:29,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:29,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:29,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:29,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:29,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:29,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:29,496 INFO L87 Difference]: Start difference. First operand 593 states and 924 transitions. Second operand 6 states. [2019-09-10 02:35:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:29,618 INFO L93 Difference]: Finished difference Result 596 states and 927 transitions. [2019-09-10 02:35:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:29,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-09-10 02:35:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:29,625 INFO L225 Difference]: With dead ends: 596 [2019-09-10 02:35:29,626 INFO L226 Difference]: Without dead ends: 593 [2019-09-10 02:35:29,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-10 02:35:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-09-10 02:35:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-10 02:35:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 923 transitions. [2019-09-10 02:35:29,649 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 923 transitions. Word has length 137 [2019-09-10 02:35:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:29,649 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 923 transitions. [2019-09-10 02:35:29,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 923 transitions. [2019-09-10 02:35:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:35:29,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:29,656 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:29,656 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash -980688005, now seen corresponding path program 1 times [2019-09-10 02:35:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:29,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:29,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:29,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:29,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:29,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:29,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:29,774 INFO L87 Difference]: Start difference. First operand 593 states and 923 transitions. Second operand 6 states. [2019-09-10 02:35:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:29,862 INFO L93 Difference]: Finished difference Result 596 states and 926 transitions. [2019-09-10 02:35:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:29,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-09-10 02:35:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:29,867 INFO L225 Difference]: With dead ends: 596 [2019-09-10 02:35:29,867 INFO L226 Difference]: Without dead ends: 593 [2019-09-10 02:35:29,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-10 02:35:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-09-10 02:35:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-10 02:35:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 922 transitions. [2019-09-10 02:35:29,885 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 922 transitions. Word has length 138 [2019-09-10 02:35:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:29,885 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 922 transitions. [2019-09-10 02:35:29,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 922 transitions. [2019-09-10 02:35:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:35:29,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:29,891 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:29,891 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1284175384, now seen corresponding path program 1 times [2019-09-10 02:35:29,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:29,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:29,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:30,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:30,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:35:30,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:30,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:35:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:35:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:35:30,119 INFO L87 Difference]: Start difference. First operand 593 states and 922 transitions. Second operand 12 states. [2019-09-10 02:35:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:30,297 INFO L93 Difference]: Finished difference Result 597 states and 925 transitions. [2019-09-10 02:35:30,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:35:30,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2019-09-10 02:35:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:30,302 INFO L225 Difference]: With dead ends: 597 [2019-09-10 02:35:30,303 INFO L226 Difference]: Without dead ends: 593 [2019-09-10 02:35:30,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:35:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-10 02:35:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-09-10 02:35:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-10 02:35:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 921 transitions. [2019-09-10 02:35:30,340 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 921 transitions. Word has length 139 [2019-09-10 02:35:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:30,340 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 921 transitions. [2019-09-10 02:35:30,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:35:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 921 transitions. [2019-09-10 02:35:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:35:30,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:30,345 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:30,345 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1594513904, now seen corresponding path program 1 times [2019-09-10 02:35:30,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:30,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:30,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:30,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:30,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:30,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:30,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:30,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:30,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:30,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:30,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:30,531 INFO L87 Difference]: Start difference. First operand 593 states and 921 transitions. Second operand 6 states. [2019-09-10 02:35:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:35,013 INFO L93 Difference]: Finished difference Result 1250 states and 2006 transitions. [2019-09-10 02:35:35,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:35:35,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 02:35:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:35,026 INFO L225 Difference]: With dead ends: 1250 [2019-09-10 02:35:35,026 INFO L226 Difference]: Without dead ends: 1250 [2019-09-10 02:35:35,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-09-10 02:35:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1167. [2019-09-10 02:35:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-09-10 02:35:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1860 transitions. [2019-09-10 02:35:35,081 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1860 transitions. Word has length 140 [2019-09-10 02:35:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:35,082 INFO L475 AbstractCegarLoop]: Abstraction has 1167 states and 1860 transitions. [2019-09-10 02:35:35,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1860 transitions. [2019-09-10 02:35:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:35:35,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:35,087 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:35,088 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1854401282, now seen corresponding path program 1 times [2019-09-10 02:35:35,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:35,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:35,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:35,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:35,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:35,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:35,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:35,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:35,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:35,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:35,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:35,258 INFO L87 Difference]: Start difference. First operand 1167 states and 1860 transitions. Second operand 6 states. [2019-09-10 02:35:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:39,908 INFO L93 Difference]: Finished difference Result 2624 states and 4328 transitions. [2019-09-10 02:35:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:35:39,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 02:35:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:39,928 INFO L225 Difference]: With dead ends: 2624 [2019-09-10 02:35:39,928 INFO L226 Difference]: Without dead ends: 2624 [2019-09-10 02:35:39,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-09-10 02:35:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2428. [2019-09-10 02:35:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-09-10 02:35:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3951 transitions. [2019-09-10 02:35:40,025 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3951 transitions. Word has length 141 [2019-09-10 02:35:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:40,026 INFO L475 AbstractCegarLoop]: Abstraction has 2428 states and 3951 transitions. [2019-09-10 02:35:40,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3951 transitions. [2019-09-10 02:35:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:35:40,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:40,031 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:40,031 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:40,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2086190540, now seen corresponding path program 1 times [2019-09-10 02:35:40,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:40,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:40,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:40,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:40,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:40,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:40,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:40,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:40,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:40,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:40,184 INFO L87 Difference]: Start difference. First operand 2428 states and 3951 transitions. Second operand 6 states. [2019-09-10 02:35:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:44,645 INFO L93 Difference]: Finished difference Result 5804 states and 9857 transitions. [2019-09-10 02:35:44,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:35:44,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 02:35:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:44,696 INFO L225 Difference]: With dead ends: 5804 [2019-09-10 02:35:44,696 INFO L226 Difference]: Without dead ends: 5804 [2019-09-10 02:35:44,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-09-10 02:35:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5283. [2019-09-10 02:35:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5283 states. [2019-09-10 02:35:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 8798 transitions. [2019-09-10 02:35:44,990 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 8798 transitions. Word has length 142 [2019-09-10 02:35:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:44,993 INFO L475 AbstractCegarLoop]: Abstraction has 5283 states and 8798 transitions. [2019-09-10 02:35:44,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 8798 transitions. [2019-09-10 02:35:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:35:44,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:45,000 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:45,000 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1197315910, now seen corresponding path program 1 times [2019-09-10 02:35:45,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:45,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:45,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:45,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:45,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:45,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:45,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:45,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:45,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:45,148 INFO L87 Difference]: Start difference. First operand 5283 states and 8798 transitions. Second operand 6 states. [2019-09-10 02:35:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:49,929 INFO L93 Difference]: Finished difference Result 13498 states and 23778 transitions. [2019-09-10 02:35:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:35:49,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 02:35:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:50,051 INFO L225 Difference]: With dead ends: 13498 [2019-09-10 02:35:50,051 INFO L226 Difference]: Without dead ends: 13498 [2019-09-10 02:35:50,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13498 states. [2019-09-10 02:35:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13498 to 12022. [2019-09-10 02:35:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12022 states. [2019-09-10 02:35:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12022 states to 12022 states and 20671 transitions. [2019-09-10 02:35:51,273 INFO L78 Accepts]: Start accepts. Automaton has 12022 states and 20671 transitions. Word has length 143 [2019-09-10 02:35:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:51,273 INFO L475 AbstractCegarLoop]: Abstraction has 12022 states and 20671 transitions. [2019-09-10 02:35:51,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 12022 states and 20671 transitions. [2019-09-10 02:35:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:35:51,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:51,279 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:51,279 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1130931207, now seen corresponding path program 1 times [2019-09-10 02:35:51,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:51,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:51,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:51,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:51,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:51,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:51,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:35:51,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:51,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:35:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:35:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:35:51,428 INFO L87 Difference]: Start difference. First operand 12022 states and 20671 transitions. Second operand 9 states. [2019-09-10 02:35:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:58,296 INFO L93 Difference]: Finished difference Result 26908 states and 46123 transitions. [2019-09-10 02:35:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:35:58,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-10 02:35:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:58,641 INFO L225 Difference]: With dead ends: 26908 [2019-09-10 02:35:58,641 INFO L226 Difference]: Without dead ends: 26908 [2019-09-10 02:35:58,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:35:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26908 states. [2019-09-10 02:35:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26908 to 26489. [2019-09-10 02:35:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26489 states. [2019-09-10 02:35:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26489 states to 26489 states and 45285 transitions. [2019-09-10 02:35:59,604 INFO L78 Accepts]: Start accepts. Automaton has 26489 states and 45285 transitions. Word has length 144 [2019-09-10 02:35:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:59,604 INFO L475 AbstractCegarLoop]: Abstraction has 26489 states and 45285 transitions. [2019-09-10 02:35:59,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:35:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 26489 states and 45285 transitions. [2019-09-10 02:35:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:35:59,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:59,610 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:59,611 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:59,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2139747080, now seen corresponding path program 1 times [2019-09-10 02:35:59,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:59,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:59,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:59,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:59,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:35:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:59,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:35:59,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:59,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:35:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:35:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:59,729 INFO L87 Difference]: Start difference. First operand 26489 states and 45285 transitions. Second operand 5 states. [2019-09-10 02:36:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:00,043 INFO L93 Difference]: Finished difference Result 26672 states and 45524 transitions. [2019-09-10 02:36:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:36:00,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 02:36:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:00,466 INFO L225 Difference]: With dead ends: 26672 [2019-09-10 02:36:00,467 INFO L226 Difference]: Without dead ends: 26672 [2019-09-10 02:36:00,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:36:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26672 states. [2019-09-10 02:36:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26672 to 26504. [2019-09-10 02:36:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26504 states. [2019-09-10 02:36:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26504 states to 26504 states and 45303 transitions. [2019-09-10 02:36:01,369 INFO L78 Accepts]: Start accepts. Automaton has 26504 states and 45303 transitions. Word has length 150 [2019-09-10 02:36:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:01,369 INFO L475 AbstractCegarLoop]: Abstraction has 26504 states and 45303 transitions. [2019-09-10 02:36:01,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:36:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 26504 states and 45303 transitions. [2019-09-10 02:36:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 02:36:01,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:01,377 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:01,377 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:01,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash -535561698, now seen corresponding path program 1 times [2019-09-10 02:36:01,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:01,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:01,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:01,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:01,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:36:01,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:01,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:36:01,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:01,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:36:01,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:36:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:01,561 INFO L87 Difference]: Start difference. First operand 26504 states and 45303 transitions. Second operand 7 states. [2019-09-10 02:36:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:01,925 INFO L93 Difference]: Finished difference Result 27192 states and 46281 transitions. [2019-09-10 02:36:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:36:01,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-09-10 02:36:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:02,129 INFO L225 Difference]: With dead ends: 27192 [2019-09-10 02:36:02,129 INFO L226 Difference]: Without dead ends: 27192 [2019-09-10 02:36:02,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27192 states. [2019-09-10 02:36:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27192 to 26840. [2019-09-10 02:36:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26840 states. [2019-09-10 02:36:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26840 states to 26840 states and 45783 transitions. [2019-09-10 02:36:03,914 INFO L78 Accepts]: Start accepts. Automaton has 26840 states and 45783 transitions. Word has length 149 [2019-09-10 02:36:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:03,915 INFO L475 AbstractCegarLoop]: Abstraction has 26840 states and 45783 transitions. [2019-09-10 02:36:03,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:36:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26840 states and 45783 transitions. [2019-09-10 02:36:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:36:03,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:03,920 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:03,921 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:03,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash -906991434, now seen corresponding path program 1 times [2019-09-10 02:36:03,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:03,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:03,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:36:04,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:04,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:36:04,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:04,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:36:04,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:36:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:04,043 INFO L87 Difference]: Start difference. First operand 26840 states and 45783 transitions. Second operand 7 states. [2019-09-10 02:36:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:04,488 INFO L93 Difference]: Finished difference Result 27432 states and 46569 transitions. [2019-09-10 02:36:04,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:36:04,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-09-10 02:36:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:04,699 INFO L225 Difference]: With dead ends: 27432 [2019-09-10 02:36:04,700 INFO L226 Difference]: Without dead ends: 27432 [2019-09-10 02:36:04,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27432 states. [2019-09-10 02:36:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27432 to 26888. [2019-09-10 02:36:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26888 states. [2019-09-10 02:36:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26888 states to 26888 states and 45831 transitions. [2019-09-10 02:36:06,294 INFO L78 Accepts]: Start accepts. Automaton has 26888 states and 45831 transitions. Word has length 150 [2019-09-10 02:36:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:06,294 INFO L475 AbstractCegarLoop]: Abstraction has 26888 states and 45831 transitions. [2019-09-10 02:36:06,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:36:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 26888 states and 45831 transitions. [2019-09-10 02:36:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:36:06,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:06,298 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:06,299 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1874870327, now seen corresponding path program 1 times [2019-09-10 02:36:06,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:06,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:06,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:06,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:06,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:36:06,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:06,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:06,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:06,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:06,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:06,423 INFO L87 Difference]: Start difference. First operand 26888 states and 45831 transitions. Second operand 6 states. [2019-09-10 02:36:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:12,055 INFO L93 Difference]: Finished difference Result 72001 states and 131370 transitions. [2019-09-10 02:36:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:36:12,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-10 02:36:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:12,576 INFO L225 Difference]: With dead ends: 72001 [2019-09-10 02:36:12,576 INFO L226 Difference]: Without dead ends: 72001 [2019-09-10 02:36:12,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72001 states. [2019-09-10 02:36:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72001 to 63334. [2019-09-10 02:36:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63334 states. [2019-09-10 02:36:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63334 states to 63334 states and 112630 transitions. [2019-09-10 02:36:17,391 INFO L78 Accepts]: Start accepts. Automaton has 63334 states and 112630 transitions. Word has length 150 [2019-09-10 02:36:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:17,392 INFO L475 AbstractCegarLoop]: Abstraction has 63334 states and 112630 transitions. [2019-09-10 02:36:17,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 63334 states and 112630 transitions. [2019-09-10 02:36:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 02:36:17,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:17,398 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:17,398 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash -541782994, now seen corresponding path program 1 times [2019-09-10 02:36:17,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:17,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:36:17,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:17,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:36:17,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:17,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:36:17,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:36:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:17,634 INFO L87 Difference]: Start difference. First operand 63334 states and 112630 transitions. Second operand 8 states. [2019-09-10 02:36:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:24,411 INFO L93 Difference]: Finished difference Result 150594 states and 269419 transitions. [2019-09-10 02:36:24,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:36:24,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-09-10 02:36:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:25,442 INFO L225 Difference]: With dead ends: 150594 [2019-09-10 02:36:25,443 INFO L226 Difference]: Without dead ends: 150594 [2019-09-10 02:36:25,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:36:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150594 states. [2019-09-10 02:36:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150594 to 150464. [2019-09-10 02:36:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150464 states. [2019-09-10 02:36:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150464 states to 150464 states and 269251 transitions. [2019-09-10 02:36:33,108 INFO L78 Accepts]: Start accepts. Automaton has 150464 states and 269251 transitions. Word has length 159 [2019-09-10 02:36:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:33,108 INFO L475 AbstractCegarLoop]: Abstraction has 150464 states and 269251 transitions. [2019-09-10 02:36:33,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:36:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 150464 states and 269251 transitions. [2019-09-10 02:36:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:36:33,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:33,112 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:33,113 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash -937157415, now seen corresponding path program 1 times [2019-09-10 02:36:33,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:33,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:33,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:33,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:33,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:36:33,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:33,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:36:33,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:33,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:36:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:36:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:33,224 INFO L87 Difference]: Start difference. First operand 150464 states and 269251 transitions. Second operand 7 states. [2019-09-10 02:36:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:34,980 INFO L93 Difference]: Finished difference Result 151296 states and 270019 transitions. [2019-09-10 02:36:34,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:36:34,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-09-10 02:36:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:40,307 INFO L225 Difference]: With dead ends: 151296 [2019-09-10 02:36:40,307 INFO L226 Difference]: Without dead ends: 151232 [2019-09-10 02:36:40,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151232 states. [2019-09-10 02:36:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151232 to 151232. [2019-09-10 02:36:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151232 states. [2019-09-10 02:36:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151232 states to 151232 states and 269955 transitions. [2019-09-10 02:36:44,986 INFO L78 Accepts]: Start accepts. Automaton has 151232 states and 269955 transitions. Word has length 160 [2019-09-10 02:36:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:44,987 INFO L475 AbstractCegarLoop]: Abstraction has 151232 states and 269955 transitions. [2019-09-10 02:36:44,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:36:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 151232 states and 269955 transitions. [2019-09-10 02:36:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 02:36:44,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:44,994 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:44,994 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -40979621, now seen corresponding path program 1 times [2019-09-10 02:36:44,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:44,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:44,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:44,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:36:45,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:45,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:36:45,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:45,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:36:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:36:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:45,129 INFO L87 Difference]: Start difference. First operand 151232 states and 269955 transitions. Second operand 7 states. [2019-09-10 02:36:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:55,366 INFO L93 Difference]: Finished difference Result 156499 states and 279415 transitions. [2019-09-10 02:36:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:36:55,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 162 [2019-09-10 02:36:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:56,294 INFO L225 Difference]: With dead ends: 156499 [2019-09-10 02:36:56,294 INFO L226 Difference]: Without dead ends: 156499 [2019-09-10 02:36:56,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:36:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156499 states. [2019-09-10 02:36:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156499 to 154944. [2019-09-10 02:36:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154944 states. [2019-09-10 02:37:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154944 states to 154944 states and 274978 transitions. [2019-09-10 02:37:00,294 INFO L78 Accepts]: Start accepts. Automaton has 154944 states and 274978 transitions. Word has length 162 [2019-09-10 02:37:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:00,295 INFO L475 AbstractCegarLoop]: Abstraction has 154944 states and 274978 transitions. [2019-09-10 02:37:00,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:37:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 154944 states and 274978 transitions. [2019-09-10 02:37:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 02:37:00,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:00,299 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:00,300 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1433367631, now seen corresponding path program 1 times [2019-09-10 02:37:00,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:00,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:00,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:37:00,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:00,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:00,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:00,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:00,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:00,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:00,406 INFO L87 Difference]: Start difference. First operand 154944 states and 274978 transitions. Second operand 6 states. [2019-09-10 02:37:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:03,302 INFO L93 Difference]: Finished difference Result 195402 states and 344948 transitions. [2019-09-10 02:37:03,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:37:03,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-09-10 02:37:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:04,782 INFO L225 Difference]: With dead ends: 195402 [2019-09-10 02:37:04,782 INFO L226 Difference]: Without dead ends: 195402 [2019-09-10 02:37:04,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195402 states. [2019-09-10 02:37:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195402 to 187204. [2019-09-10 02:37:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187204 states. [2019-09-10 02:37:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187204 states to 187204 states and 332082 transitions. [2019-09-10 02:37:14,799 INFO L78 Accepts]: Start accepts. Automaton has 187204 states and 332082 transitions. Word has length 166 [2019-09-10 02:37:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:14,800 INFO L475 AbstractCegarLoop]: Abstraction has 187204 states and 332082 transitions. [2019-09-10 02:37:14,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 187204 states and 332082 transitions. [2019-09-10 02:37:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 02:37:14,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:14,804 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:14,805 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:14,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1431320775, now seen corresponding path program 1 times [2019-09-10 02:37:14,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:14,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:14,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:14,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:14,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:37:14,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:14,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:37:14,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:14,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:37:14,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:37:14,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:37:14,949 INFO L87 Difference]: Start difference. First operand 187204 states and 332082 transitions. Second operand 10 states. [2019-09-10 02:37:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:34,695 INFO L93 Difference]: Finished difference Result 490420 states and 936509 transitions. [2019-09-10 02:37:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:34,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 167 [2019-09-10 02:37:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:37,895 INFO L225 Difference]: With dead ends: 490420 [2019-09-10 02:37:37,895 INFO L226 Difference]: Without dead ends: 490420 [2019-09-10 02:37:37,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:37:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490420 states. [2019-09-10 02:37:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490420 to 488289. [2019-09-10 02:37:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488289 states. [2019-09-10 02:38:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488289 states to 488289 states and 919975 transitions. [2019-09-10 02:38:16,452 INFO L78 Accepts]: Start accepts. Automaton has 488289 states and 919975 transitions. Word has length 167 [2019-09-10 02:38:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:16,452 INFO L475 AbstractCegarLoop]: Abstraction has 488289 states and 919975 transitions. [2019-09-10 02:38:16,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:38:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 488289 states and 919975 transitions. [2019-09-10 02:38:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 02:38:16,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:16,460 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:16,461 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:16,461 INFO L82 PathProgramCache]: Analyzing trace with hash 93934821, now seen corresponding path program 1 times [2019-09-10 02:38:16,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:16,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:16,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:38:16,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:16,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:38:16,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:16,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:38:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:38:16,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:38:16,627 INFO L87 Difference]: Start difference. First operand 488289 states and 919975 transitions. Second operand 10 states. [2019-09-10 02:39:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:20,246 INFO L93 Difference]: Finished difference Result 1359838 states and 2800889 transitions. [2019-09-10 02:39:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:39:20,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 167 [2019-09-10 02:39:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:33,512 INFO L225 Difference]: With dead ends: 1359838 [2019-09-10 02:39:33,512 INFO L226 Difference]: Without dead ends: 1359838 [2019-09-10 02:39:33,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:39:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359838 states.