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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:14:15,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:14:15,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:14:15,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:14:15,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:14:15,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:14:15,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:14:15,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:14:15,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:14:15,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:14:15,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:14:15,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:14:15,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:14:15,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:14:15,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:14:15,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:14:15,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:14:15,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:14:15,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:14:15,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:14:15,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:14:15,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:14:15,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:14:15,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:14:15,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:14:15,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:14:15,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:14:15,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:14:15,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:14:15,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:14:15,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:14:15,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:14:15,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:14:15,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:14:15,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:14:15,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:14:15,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:14:15,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:14:15,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:14:15,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:14:15,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:14:15,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:14:15,360 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:14:15,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:14:15,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:14:15,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:14:15,362 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:14:15,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:14:15,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:14:15,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:14:15,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:14:15,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:14:15,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:14:15,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:14:15,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:14:15,366 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:14:15,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:14:15,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:14:15,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:14:15,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:14:15,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:14:15,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:14:15,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:14:15,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:14:15,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:14:15,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:14:15,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:14:15,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:14:15,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:14:15,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:14:15,369 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:14:15,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:14:15,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:14:15,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:14:15,442 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:14:15,442 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:14:15,443 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c [2019-10-02 12:14:15,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10cff79c9/d82a898bb91541b0824aa951dfcc8956/FLAGf00e46951 [2019-10-02 12:14:16,096 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:14:16,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c [2019-10-02 12:14:16,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10cff79c9/d82a898bb91541b0824aa951dfcc8956/FLAGf00e46951 [2019-10-02 12:14:16,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10cff79c9/d82a898bb91541b0824aa951dfcc8956 [2019-10-02 12:14:16,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:14:16,389 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:14:16,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:14:16,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:14:16,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:14:16,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:14:16" (1/1) ... [2019-10-02 12:14:16,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8ca767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:16, skipping insertion in model container [2019-10-02 12:14:16,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:14:16" (1/1) ... [2019-10-02 12:14:16,407 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:14:16,491 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:14:17,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:14:17,160 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:14:17,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:14:17,426 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:14:17,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17 WrapperNode [2019-10-02 12:14:17,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:14:17,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:14:17,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:14:17,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:14:17,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (1/1) ... [2019-10-02 12:14:17,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (1/1) ... [2019-10-02 12:14:17,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (1/1) ... [2019-10-02 12:14:17,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (1/1) ... [2019-10-02 12:14:17,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (1/1) ... [2019-10-02 12:14:17,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (1/1) ... [2019-10-02 12:14:17,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (1/1) ... [2019-10-02 12:14:17,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:14:17,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:14:17,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:14:17,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:14:17,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:14:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:14:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:14:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:14:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:14:17,706 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:14:17,706 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:14:17,706 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:14:17,706 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:14:17,706 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:14:17,707 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:14:17,707 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:14:17,707 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:14:17,707 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:14:17,707 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:14:17,708 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:14:17,708 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:14:17,708 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:14:17,708 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:14:17,708 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:14:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:14:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:14:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:14:17,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:14:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:14:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:14:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:14:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:14:17,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:14:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:14:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:14:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:14:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:14:17,711 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:14:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:14:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:14:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:14:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:14:17,712 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:14:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:14:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:14:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:14:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:14:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:14:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:14:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:14:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:14:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:14:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:14:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:14:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:14:17,715 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:14:17,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:14:17,715 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:14:17,715 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:14:17,715 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:14:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:14:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:14:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:14:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:14:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:14:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:14:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:14:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:14:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:14:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:14:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:14:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:14:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:14:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:14:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:14:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:14:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:14:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:14:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:14:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:14:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:14:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:14:17,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:14:17,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:14:17,720 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:14:17,720 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:14:17,720 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:14:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:14:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:14:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:14:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:14:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:14:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:14:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:14:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:14:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:14:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:14:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:14:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:14:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:14:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:14:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:14:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:14:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:14:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:14:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:14:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:14:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:14:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:14:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:14:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:14:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:14:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:14:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:14:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:14:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:14:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:14:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:14:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:14:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:14:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:14:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:14:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:14:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:14:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:14:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:14:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:14:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:14:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:14:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:14:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:14:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:14:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:14:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:14:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:14:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:14:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:14:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:14:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:14:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:14:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:14:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:14:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:14:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:14:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:14:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:14:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:14:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:14:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:14:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:14:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:14:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:14:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:14:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:14:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:14:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:14:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:14:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:14:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:14:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:14:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:14:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:14:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:14:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:14:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:14:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:14:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:14:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:14:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:14:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:14:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:14:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:14:17,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:14:17,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:14:19,957 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:14:19,957 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:14:19,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:14:19 BoogieIcfgContainer [2019-10-02 12:14:19,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:14:19,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:14:19,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:14:19,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:14:19,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:14:16" (1/3) ... [2019-10-02 12:14:19,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208cf0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:14:19, skipping insertion in model container [2019-10-02 12:14:19,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:14:17" (2/3) ... [2019-10-02 12:14:19,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208cf0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:14:19, skipping insertion in model container [2019-10-02 12:14:19,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:14:19" (3/3) ... [2019-10-02 12:14:19,970 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product11.cil.c [2019-10-02 12:14:19,979 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:14:19,994 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:14:20,011 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:14:20,068 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:14:20,069 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:14:20,069 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:14:20,070 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:14:20,070 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:14:20,070 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:14:20,070 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:14:20,070 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:14:20,070 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:14:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states. [2019-10-02 12:14:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:14:20,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:20,156 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:20,159 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash -353986784, now seen corresponding path program 1 times [2019-10-02 12:14:20,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:20,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:20,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:20,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:20,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:20,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:20,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:20,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:20,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:20,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:20,799 INFO L87 Difference]: Start difference. First operand 765 states. Second operand 4 states. [2019-10-02 12:14:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:20,983 INFO L93 Difference]: Finished difference Result 1193 states and 1933 transitions. [2019-10-02 12:14:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:14:20,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-02 12:14:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:21,013 INFO L225 Difference]: With dead ends: 1193 [2019-10-02 12:14:21,013 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:14:21,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:14:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:14:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:14:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:14:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 968 transitions. [2019-10-02 12:14:21,203 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 968 transitions. Word has length 133 [2019-10-02 12:14:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:21,204 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 968 transitions. [2019-10-02 12:14:21,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 968 transitions. [2019-10-02 12:14:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:14:21,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:21,213 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:21,214 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash 253416708, now seen corresponding path program 1 times [2019-10-02 12:14:21,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:21,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:21,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:21,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:21,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:21,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:21,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:21,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:21,474 INFO L87 Difference]: Start difference. First operand 605 states and 968 transitions. Second operand 4 states. [2019-10-02 12:14:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:21,575 INFO L93 Difference]: Finished difference Result 1173 states and 1894 transitions. [2019-10-02 12:14:21,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:14:21,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-02 12:14:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:21,587 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:14:21,588 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:14:21,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:14:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:14:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:14:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:14:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 967 transitions. [2019-10-02 12:14:21,635 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 967 transitions. Word has length 136 [2019-10-02 12:14:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:21,637 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 967 transitions. [2019-10-02 12:14:21,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 967 transitions. [2019-10-02 12:14:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:14:21,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:21,652 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:21,652 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash -602392881, now seen corresponding path program 1 times [2019-10-02 12:14:21,660 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:21,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:21,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:21,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:21,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:21,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:21,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:21,859 INFO L87 Difference]: Start difference. First operand 605 states and 967 transitions. Second operand 4 states. [2019-10-02 12:14:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:21,973 INFO L93 Difference]: Finished difference Result 1173 states and 1893 transitions. [2019-10-02 12:14:21,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:14:21,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-02 12:14:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:21,980 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:14:21,980 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:14:21,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:14:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:14:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:14:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:14:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 966 transitions. [2019-10-02 12:14:22,022 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 966 transitions. Word has length 137 [2019-10-02 12:14:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:22,023 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 966 transitions. [2019-10-02 12:14:22,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 966 transitions. [2019-10-02 12:14:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:14:22,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:22,029 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:22,029 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1415901664, now seen corresponding path program 1 times [2019-10-02 12:14:22,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:22,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:22,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:22,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:22,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:22,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:22,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:22,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:22,231 INFO L87 Difference]: Start difference. First operand 605 states and 966 transitions. Second operand 4 states. [2019-10-02 12:14:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:22,290 INFO L93 Difference]: Finished difference Result 1173 states and 1892 transitions. [2019-10-02 12:14:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:14:22,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:14:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:22,296 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:14:22,297 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:14:22,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:14:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:14:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:14:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:14:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 965 transitions. [2019-10-02 12:14:22,328 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 965 transitions. Word has length 138 [2019-10-02 12:14:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:22,329 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 965 transitions. [2019-10-02 12:14:22,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 965 transitions. [2019-10-02 12:14:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:14:22,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:22,335 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:22,335 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1957856149, now seen corresponding path program 1 times [2019-10-02 12:14:22,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:22,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:22,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:22,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:22,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:22,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:22,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:22,464 INFO L87 Difference]: Start difference. First operand 605 states and 965 transitions. Second operand 4 states. [2019-10-02 12:14:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:22,519 INFO L93 Difference]: Finished difference Result 1173 states and 1891 transitions. [2019-10-02 12:14:22,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:14:22,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-02 12:14:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:22,524 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:14:22,524 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:14:22,527 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:14:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:14:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:14:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:14:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 964 transitions. [2019-10-02 12:14:22,550 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 964 transitions. Word has length 139 [2019-10-02 12:14:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:22,551 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 964 transitions. [2019-10-02 12:14:22,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 964 transitions. [2019-10-02 12:14:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:14:22,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:22,555 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:22,555 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash -686545220, now seen corresponding path program 1 times [2019-10-02 12:14:22,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:22,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:22,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:22,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:22,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:22,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:14:22,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:14:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:14:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:14:22,758 INFO L87 Difference]: Start difference. First operand 605 states and 964 transitions. Second operand 10 states. [2019-10-02 12:14:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:22,967 INFO L93 Difference]: Finished difference Result 1131 states and 1811 transitions. [2019-10-02 12:14:22,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:14:22,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-02 12:14:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:22,973 INFO L225 Difference]: With dead ends: 1131 [2019-10-02 12:14:22,974 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 12:14:22,977 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:14:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 12:14:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2019-10-02 12:14:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:14:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 973 transitions. [2019-10-02 12:14:23,005 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 973 transitions. Word has length 140 [2019-10-02 12:14:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:23,006 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 973 transitions. [2019-10-02 12:14:23,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:14:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 973 transitions. [2019-10-02 12:14:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:14:23,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:23,011 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:23,011 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash 8101787, now seen corresponding path program 1 times [2019-10-02 12:14:23,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:23,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:23,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:23,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:23,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:23,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:23,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:23,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:23,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:23,128 INFO L87 Difference]: Start difference. First operand 612 states and 973 transitions. Second operand 4 states. [2019-10-02 12:14:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:23,177 INFO L93 Difference]: Finished difference Result 1179 states and 1897 transitions. [2019-10-02 12:14:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:14:23,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-02 12:14:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:23,182 INFO L225 Difference]: With dead ends: 1179 [2019-10-02 12:14:23,182 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:14:23,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:14:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:14:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 12:14:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 12:14:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 950 transitions. [2019-10-02 12:14:23,207 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 950 transitions. Word has length 140 [2019-10-02 12:14:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:23,207 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 950 transitions. [2019-10-02 12:14:23,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 950 transitions. [2019-10-02 12:14:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:14:23,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:23,212 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:23,212 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash 590106207, now seen corresponding path program 1 times [2019-10-02 12:14:23,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:23,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:23,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:23,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:23,344 INFO L87 Difference]: Start difference. First operand 599 states and 950 transitions. Second operand 6 states. [2019-10-02 12:14:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:23,570 INFO L93 Difference]: Finished difference Result 1119 states and 1789 transitions. [2019-10-02 12:14:23,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:23,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 12:14:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:23,576 INFO L225 Difference]: With dead ends: 1119 [2019-10-02 12:14:23,576 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:14:23,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:14:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:14:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 12:14:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 12:14:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 946 transitions. [2019-10-02 12:14:23,600 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 946 transitions. Word has length 141 [2019-10-02 12:14:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:23,600 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 946 transitions. [2019-10-02 12:14:23,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:14:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 946 transitions. [2019-10-02 12:14:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:14:23,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:23,605 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:23,606 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:23,606 INFO L82 PathProgramCache]: Analyzing trace with hash 871479167, now seen corresponding path program 1 times [2019-10-02 12:14:23,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:23,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:23,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:23,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:23,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:23,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:23,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:23,791 INFO L87 Difference]: Start difference. First operand 599 states and 946 transitions. Second operand 6 states. [2019-10-02 12:14:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:24,014 INFO L93 Difference]: Finished difference Result 1119 states and 1785 transitions. [2019-10-02 12:14:24,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:24,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 12:14:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:24,022 INFO L225 Difference]: With dead ends: 1119 [2019-10-02 12:14:24,022 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:14:24,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:14:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:14:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 12:14:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 12:14:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 942 transitions. [2019-10-02 12:14:24,051 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 942 transitions. Word has length 142 [2019-10-02 12:14:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:24,052 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 942 transitions. [2019-10-02 12:14:24,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:14:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 942 transitions. [2019-10-02 12:14:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:14:24,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:24,058 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:24,059 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash 711816804, now seen corresponding path program 1 times [2019-10-02 12:14:24,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:24,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:24,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:24,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:24,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:24,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:24,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:24,207 INFO L87 Difference]: Start difference. First operand 599 states and 942 transitions. Second operand 6 states. [2019-10-02 12:14:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:24,382 INFO L93 Difference]: Finished difference Result 1119 states and 1781 transitions. [2019-10-02 12:14:24,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:24,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:14:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:24,388 INFO L225 Difference]: With dead ends: 1119 [2019-10-02 12:14:24,388 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 12:14:24,391 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:14:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 12:14:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 12:14:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 12:14:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 938 transitions. [2019-10-02 12:14:24,414 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 938 transitions. Word has length 143 [2019-10-02 12:14:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:24,414 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 938 transitions. [2019-10-02 12:14:24,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:14:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 938 transitions. [2019-10-02 12:14:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:14:24,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:24,419 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:24,419 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:24,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1766290148, now seen corresponding path program 1 times [2019-10-02 12:14:24,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:24,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:24,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:24,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:24,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:24,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:24,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:14:24,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:14:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:14:24,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:14:24,546 INFO L87 Difference]: Start difference. First operand 599 states and 938 transitions. Second operand 7 states. [2019-10-02 12:14:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:24,629 INFO L93 Difference]: Finished difference Result 1119 states and 1777 transitions. [2019-10-02 12:14:24,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:14:24,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-02 12:14:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:24,634 INFO L225 Difference]: With dead ends: 1119 [2019-10-02 12:14:24,635 INFO L226 Difference]: Without dead ends: 578 [2019-10-02 12:14:24,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:14:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-02 12:14:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-02 12:14:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-02 12:14:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 904 transitions. [2019-10-02 12:14:24,658 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 904 transitions. Word has length 143 [2019-10-02 12:14:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:24,658 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 904 transitions. [2019-10-02 12:14:24,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:14:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 904 transitions. [2019-10-02 12:14:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:14:24,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:24,663 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:24,663 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:24,663 INFO L82 PathProgramCache]: Analyzing trace with hash -235038684, now seen corresponding path program 1 times [2019-10-02 12:14:24,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:24,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:24,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:24,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:24,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:24,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:24,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:24,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:24,851 INFO L87 Difference]: Start difference. First operand 578 states and 904 transitions. Second operand 6 states. [2019-10-02 12:14:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:24,959 INFO L93 Difference]: Finished difference Result 1098 states and 1743 transitions. [2019-10-02 12:14:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:24,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:14:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:24,964 INFO L225 Difference]: With dead ends: 1098 [2019-10-02 12:14:24,964 INFO L226 Difference]: Without dead ends: 578 [2019-10-02 12:14:24,967 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:14:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-02 12:14:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-02 12:14:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-02 12:14:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 903 transitions. [2019-10-02 12:14:24,987 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 903 transitions. Word has length 144 [2019-10-02 12:14:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:24,987 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 903 transitions. [2019-10-02 12:14:24,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:14:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 903 transitions. [2019-10-02 12:14:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:14:24,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:24,992 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:24,992 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:24,992 INFO L82 PathProgramCache]: Analyzing trace with hash 184922729, now seen corresponding path program 1 times [2019-10-02 12:14:24,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:24,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:24,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:25,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:25,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:25,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:25,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:25,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:25,138 INFO L87 Difference]: Start difference. First operand 578 states and 903 transitions. Second operand 6 states. [2019-10-02 12:14:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:25,260 INFO L93 Difference]: Finished difference Result 1098 states and 1742 transitions. [2019-10-02 12:14:25,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:25,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:14:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:25,266 INFO L225 Difference]: With dead ends: 1098 [2019-10-02 12:14:25,266 INFO L226 Difference]: Without dead ends: 578 [2019-10-02 12:14:25,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:14:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-02 12:14:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-02 12:14:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-02 12:14:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 902 transitions. [2019-10-02 12:14:25,298 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 902 transitions. Word has length 145 [2019-10-02 12:14:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:25,299 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 902 transitions. [2019-10-02 12:14:25,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:14:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 902 transitions. [2019-10-02 12:14:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:14:25,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:25,305 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:25,305 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:25,306 INFO L82 PathProgramCache]: Analyzing trace with hash 26535113, now seen corresponding path program 1 times [2019-10-02 12:14:25,306 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:25,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:25,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:25,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:25,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:14:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:25,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:14:25,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:14:25,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:14:25,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:14:25,553 INFO L87 Difference]: Start difference. First operand 578 states and 902 transitions. Second operand 12 states. [2019-10-02 12:14:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:25,745 INFO L93 Difference]: Finished difference Result 1099 states and 1741 transitions. [2019-10-02 12:14:25,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:14:25,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-02 12:14:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:25,750 INFO L225 Difference]: With dead ends: 1099 [2019-10-02 12:14:25,750 INFO L226 Difference]: Without dead ends: 578 [2019-10-02 12:14:25,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:14:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-02 12:14:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-02 12:14:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-02 12:14:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 901 transitions. [2019-10-02 12:14:25,773 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 901 transitions. Word has length 146 [2019-10-02 12:14:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:25,774 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 901 transitions. [2019-10-02 12:14:25,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:14:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 901 transitions. [2019-10-02 12:14:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:14:25,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:25,778 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:25,778 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1759527944, now seen corresponding path program 1 times [2019-10-02 12:14:25,779 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:25,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:25,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:25,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:25,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:14:25,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:14:25,965 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:14:26,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:26,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:14:26,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:14:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:14:26,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:14:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:14:26,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:14:26,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:14:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:26,655 INFO L87 Difference]: Start difference. First operand 578 states and 901 transitions. Second operand 9 states. [2019-10-02 12:14:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:28,102 INFO L93 Difference]: Finished difference Result 1094 states and 1761 transitions. [2019-10-02 12:14:28,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:28,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-10-02 12:14:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:28,110 INFO L225 Difference]: With dead ends: 1094 [2019-10-02 12:14:28,110 INFO L226 Difference]: Without dead ends: 582 [2019-10-02 12:14:28,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:14:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-02 12:14:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-02 12:14:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-02 12:14:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 905 transitions. [2019-10-02 12:14:28,150 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 905 transitions. Word has length 147 [2019-10-02 12:14:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:28,151 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 905 transitions. [2019-10-02 12:14:28,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:14:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 905 transitions. [2019-10-02 12:14:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:14:28,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:28,156 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:28,156 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:28,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1319088752, now seen corresponding path program 1 times [2019-10-02 12:14:28,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:28,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:28,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:28,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:28,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:14:28,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:14:28,378 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:14:28,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:28,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:14:28,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:14:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:14:28,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:14:28,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:14:28,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:14:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:14:28,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:28,980 INFO L87 Difference]: Start difference. First operand 582 states and 905 transitions. Second operand 9 states. [2019-10-02 12:14:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:30,190 INFO L93 Difference]: Finished difference Result 1103 states and 1768 transitions. [2019-10-02 12:14:30,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:14:30,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-10-02 12:14:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:30,195 INFO L225 Difference]: With dead ends: 1103 [2019-10-02 12:14:30,195 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 12:14:30,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:14:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 12:14:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 12:14:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 12:14:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 910 transitions. [2019-10-02 12:14:30,221 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 910 transitions. Word has length 149 [2019-10-02 12:14:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:30,221 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 910 transitions. [2019-10-02 12:14:30,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:14:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 910 transitions. [2019-10-02 12:14:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 12:14:30,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:30,226 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:30,226 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1445266504, now seen corresponding path program 1 times [2019-10-02 12:14:30,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:30,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:30,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:14:30,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:14:30,360 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:14:30,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:30,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:14:30,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:14:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:14:30,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:14:30,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:14:30,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:14:30,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:14:30,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:30,925 INFO L87 Difference]: Start difference. First operand 587 states and 910 transitions. Second operand 9 states. [2019-10-02 12:14:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:32,200 INFO L93 Difference]: Finished difference Result 1114 states and 1777 transitions. [2019-10-02 12:14:32,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:14:32,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-10-02 12:14:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:32,205 INFO L225 Difference]: With dead ends: 1114 [2019-10-02 12:14:32,205 INFO L226 Difference]: Without dead ends: 593 [2019-10-02 12:14:32,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:14:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-02 12:14:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-02 12:14:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-02 12:14:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 916 transitions. [2019-10-02 12:14:32,233 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 916 transitions. Word has length 151 [2019-10-02 12:14:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:32,233 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 916 transitions. [2019-10-02 12:14:32,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:14:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 916 transitions. [2019-10-02 12:14:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:14:32,238 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:32,238 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:32,239 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 617582120, now seen corresponding path program 1 times [2019-10-02 12:14:32,239 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:32,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:32,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:32,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:32,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:14:32,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:14:32,466 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:14:32,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:32,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 2745 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:14:32,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:14:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:14:33,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:14:33,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:14:33,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:14:33,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:14:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:33,017 INFO L87 Difference]: Start difference. First operand 593 states and 916 transitions. Second operand 9 states. [2019-10-02 12:14:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:34,216 INFO L93 Difference]: Finished difference Result 1127 states and 1788 transitions. [2019-10-02 12:14:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:14:34,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 153 [2019-10-02 12:14:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:34,225 INFO L225 Difference]: With dead ends: 1127 [2019-10-02 12:14:34,225 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:14:34,228 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:14:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:14:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:14:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:14:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 923 transitions. [2019-10-02 12:14:34,252 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 923 transitions. Word has length 153 [2019-10-02 12:14:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:34,252 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 923 transitions. [2019-10-02 12:14:34,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:14:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 923 transitions. [2019-10-02 12:14:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:14:34,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:34,256 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:34,257 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash 522371720, now seen corresponding path program 1 times [2019-10-02 12:14:34,257 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:34,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:34,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:34,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:34,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:14:34,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:14:34,497 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:14:34,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:35,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:14:35,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:14:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:14:35,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:14:35,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:14:35,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:14:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:14:35,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:14:35,261 INFO L87 Difference]: Start difference. First operand 600 states and 923 transitions. Second operand 14 states. [2019-10-02 12:14:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:45,576 INFO L93 Difference]: Finished difference Result 1796 states and 2839 transitions. [2019-10-02 12:14:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:14:45,582 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2019-10-02 12:14:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:45,592 INFO L225 Difference]: With dead ends: 1796 [2019-10-02 12:14:45,592 INFO L226 Difference]: Without dead ends: 1262 [2019-10-02 12:14:45,596 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:14:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-10-02 12:14:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1206. [2019-10-02 12:14:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2019-10-02 12:14:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1894 transitions. [2019-10-02 12:14:45,669 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1894 transitions. Word has length 155 [2019-10-02 12:14:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:45,669 INFO L475 AbstractCegarLoop]: Abstraction has 1206 states and 1894 transitions. [2019-10-02 12:14:45,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:14:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1894 transitions. [2019-10-02 12:14:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:14:45,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:45,679 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:45,679 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:45,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1375059737, now seen corresponding path program 1 times [2019-10-02 12:14:45,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:45,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:45,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:45,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:45,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:14:45,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:45,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:14:45,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:14:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:14:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:45,844 INFO L87 Difference]: Start difference. First operand 1206 states and 1894 transitions. Second operand 9 states. [2019-10-02 12:14:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:45,967 INFO L93 Difference]: Finished difference Result 1747 states and 2749 transitions. [2019-10-02 12:14:45,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:14:45,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-02 12:14:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:45,974 INFO L225 Difference]: With dead ends: 1747 [2019-10-02 12:14:45,975 INFO L226 Difference]: Without dead ends: 595 [2019-10-02 12:14:45,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:14:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-02 12:14:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-02 12:14:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-02 12:14:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 910 transitions. [2019-10-02 12:14:46,007 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 910 transitions. Word has length 164 [2019-10-02 12:14:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:46,008 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 910 transitions. [2019-10-02 12:14:46,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:14:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 910 transitions. [2019-10-02 12:14:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:14:46,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:46,013 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:46,013 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1985555530, now seen corresponding path program 1 times [2019-10-02 12:14:46,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:46,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:46,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:46,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:14:46,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:14:46,246 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:14:46,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:46,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 2782 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:14:46,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:14:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:14:47,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:14:47,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:14:47,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:14:47,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:14:47,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:14:47,029 INFO L87 Difference]: Start difference. First operand 595 states and 910 transitions. Second operand 14 states. [2019-10-02 12:14:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:52,358 INFO L93 Difference]: Finished difference Result 1175 states and 1841 transitions. [2019-10-02 12:14:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:14:52,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 167 [2019-10-02 12:14:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:52,364 INFO L225 Difference]: With dead ends: 1175 [2019-10-02 12:14:52,364 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 12:14:52,366 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:14:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 12:14:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 606. [2019-10-02 12:14:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-02 12:14:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 925 transitions. [2019-10-02 12:14:52,393 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 925 transitions. Word has length 167 [2019-10-02 12:14:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:52,393 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 925 transitions. [2019-10-02 12:14:52,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:14:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 925 transitions. [2019-10-02 12:14:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:14:52,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:52,399 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:52,400 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash -483854626, now seen corresponding path program 1 times [2019-10-02 12:14:52,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:52,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:52,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:52,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:52,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:14:52,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:52,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:14:52,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:14:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:14:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:14:52,587 INFO L87 Difference]: Start difference. First operand 606 states and 925 transitions. Second operand 11 states. [2019-10-02 12:14:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:56,831 INFO L93 Difference]: Finished difference Result 1147 states and 1786 transitions. [2019-10-02 12:14:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:14:56,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2019-10-02 12:14:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:56,838 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:14:56,838 INFO L226 Difference]: Without dead ends: 604 [2019-10-02 12:14:56,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:14:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-02 12:14:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-02 12:14:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-02 12:14:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 921 transitions. [2019-10-02 12:14:56,864 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 921 transitions. Word has length 174 [2019-10-02 12:14:56,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:56,864 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 921 transitions. [2019-10-02 12:14:56,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:14:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 921 transitions. [2019-10-02 12:14:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:14:56,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:56,869 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:56,869 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:56,870 INFO L82 PathProgramCache]: Analyzing trace with hash 526177305, now seen corresponding path program 1 times [2019-10-02 12:14:56,870 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:56,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:56,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:14:57,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:57,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:14:57,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:14:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:14:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:14:57,030 INFO L87 Difference]: Start difference. First operand 604 states and 921 transitions. Second operand 9 states. [2019-10-02 12:15:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:02,086 INFO L93 Difference]: Finished difference Result 1885 states and 2952 transitions. [2019-10-02 12:15:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:15:02,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-10-02 12:15:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:02,101 INFO L225 Difference]: With dead ends: 1885 [2019-10-02 12:15:02,101 INFO L226 Difference]: Without dead ends: 1344 [2019-10-02 12:15:02,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:15:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2019-10-02 12:15:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1300. [2019-10-02 12:15:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-10-02 12:15:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2022 transitions. [2019-10-02 12:15:02,166 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2022 transitions. Word has length 176 [2019-10-02 12:15:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:02,167 INFO L475 AbstractCegarLoop]: Abstraction has 1300 states and 2022 transitions. [2019-10-02 12:15:02,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:15:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2022 transitions. [2019-10-02 12:15:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:15:02,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:02,172 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:02,172 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1991826014, now seen corresponding path program 1 times [2019-10-02 12:15:02,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:02,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:02,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:02,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:15:02,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:02,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:15:02,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:15:02,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:15:02,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:15:02,310 INFO L87 Difference]: Start difference. First operand 1300 states and 2022 transitions. Second operand 7 states. [2019-10-02 12:15:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:02,400 INFO L93 Difference]: Finished difference Result 2580 states and 4041 transitions. [2019-10-02 12:15:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:15:02,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-10-02 12:15:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:02,412 INFO L225 Difference]: With dead ends: 2580 [2019-10-02 12:15:02,412 INFO L226 Difference]: Without dead ends: 1343 [2019-10-02 12:15:02,417 INFO L640 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-10-02 12:15:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-10-02 12:15:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1321. [2019-10-02 12:15:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-10-02 12:15:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2046 transitions. [2019-10-02 12:15:02,478 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2046 transitions. Word has length 181 [2019-10-02 12:15:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:02,478 INFO L475 AbstractCegarLoop]: Abstraction has 1321 states and 2046 transitions. [2019-10-02 12:15:02,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:15:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2046 transitions. [2019-10-02 12:15:02,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:15:02,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:02,485 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:02,485 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash 135130826, now seen corresponding path program 1 times [2019-10-02 12:15:02,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:02,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:02,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:15:02,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:02,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:15:02,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:15:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:15:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:02,689 INFO L87 Difference]: Start difference. First operand 1321 states and 2046 transitions. Second operand 8 states. [2019-10-02 12:15:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:06,899 INFO L93 Difference]: Finished difference Result 4217 states and 6653 transitions. [2019-10-02 12:15:06,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:15:06,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-10-02 12:15:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:06,928 INFO L225 Difference]: With dead ends: 4217 [2019-10-02 12:15:06,928 INFO L226 Difference]: Without dead ends: 2957 [2019-10-02 12:15:06,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-10-02 12:15:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2019-10-02 12:15:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2920. [2019-10-02 12:15:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-10-02 12:15:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4544 transitions. [2019-10-02 12:15:07,140 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4544 transitions. Word has length 185 [2019-10-02 12:15:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:07,141 INFO L475 AbstractCegarLoop]: Abstraction has 2920 states and 4544 transitions. [2019-10-02 12:15:07,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:15:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4544 transitions. [2019-10-02 12:15:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:15:07,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:07,145 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:07,145 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2125971947, now seen corresponding path program 1 times [2019-10-02 12:15:07,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:07,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:15:07,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:07,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:15:07,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:15:07,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:15:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:07,416 INFO L87 Difference]: Start difference. First operand 2920 states and 4544 transitions. Second operand 9 states. [2019-10-02 12:15:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:07,838 INFO L93 Difference]: Finished difference Result 5697 states and 9026 transitions. [2019-10-02 12:15:07,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:15:07,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-10-02 12:15:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:07,865 INFO L225 Difference]: With dead ends: 5697 [2019-10-02 12:15:07,865 INFO L226 Difference]: Without dead ends: 2920 [2019-10-02 12:15:07,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:15:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2019-10-02 12:15:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2019-10-02 12:15:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-10-02 12:15:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4498 transitions. [2019-10-02 12:15:08,177 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4498 transitions. Word has length 188 [2019-10-02 12:15:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:08,177 INFO L475 AbstractCegarLoop]: Abstraction has 2920 states and 4498 transitions. [2019-10-02 12:15:08,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:15:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4498 transitions. [2019-10-02 12:15:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:15:08,183 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:08,183 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:08,184 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:08,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:08,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1482753191, now seen corresponding path program 1 times [2019-10-02 12:15:08,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:08,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:08,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:08,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:15:08,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:08,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:15:08,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:15:08,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:15:08,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:15:08,429 INFO L87 Difference]: Start difference. First operand 2920 states and 4498 transitions. Second operand 7 states. [2019-10-02 12:15:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:12,816 INFO L93 Difference]: Finished difference Result 5493 states and 8505 transitions. [2019-10-02 12:15:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:15:12,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-10-02 12:15:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:12,839 INFO L225 Difference]: With dead ends: 5493 [2019-10-02 12:15:12,840 INFO L226 Difference]: Without dead ends: 3103 [2019-10-02 12:15:12,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:15:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2019-10-02 12:15:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3036. [2019-10-02 12:15:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3036 states. [2019-10-02 12:15:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4655 transitions. [2019-10-02 12:15:13,062 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4655 transitions. Word has length 193 [2019-10-02 12:15:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:13,062 INFO L475 AbstractCegarLoop]: Abstraction has 3036 states and 4655 transitions. [2019-10-02 12:15:13,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:15:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4655 transitions. [2019-10-02 12:15:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:15:13,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:13,066 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:13,067 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1982631202, now seen corresponding path program 1 times [2019-10-02 12:15:13,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:13,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:13,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:15:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:15:13,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:15:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:15:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:15:13,202 INFO L87 Difference]: Start difference. First operand 3036 states and 4655 transitions. Second operand 6 states. [2019-10-02 12:15:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:13,412 INFO L93 Difference]: Finished difference Result 6472 states and 9974 transitions. [2019-10-02 12:15:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:15:13,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-10-02 12:15:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:13,456 INFO L225 Difference]: With dead ends: 6472 [2019-10-02 12:15:13,457 INFO L226 Difference]: Without dead ends: 3966 [2019-10-02 12:15:13,467 INFO L640 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-10-02 12:15:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2019-10-02 12:15:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3668. [2019-10-02 12:15:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3668 states. [2019-10-02 12:15:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 5622 transitions. [2019-10-02 12:15:13,626 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 5622 transitions. Word has length 198 [2019-10-02 12:15:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:13,626 INFO L475 AbstractCegarLoop]: Abstraction has 3668 states and 5622 transitions. [2019-10-02 12:15:13,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 5622 transitions. [2019-10-02 12:15:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:15:13,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:13,631 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:13,631 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:13,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1323099680, now seen corresponding path program 1 times [2019-10-02 12:15:13,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:13,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:15:13,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:13,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:15:13,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:15:13,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:15:13,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:13,853 INFO L87 Difference]: Start difference. First operand 3668 states and 5622 transitions. Second operand 8 states. [2019-10-02 12:15:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:14,029 INFO L93 Difference]: Finished difference Result 3691 states and 5651 transitions. [2019-10-02 12:15:14,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:15:14,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-10-02 12:15:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:14,054 INFO L225 Difference]: With dead ends: 3691 [2019-10-02 12:15:14,054 INFO L226 Difference]: Without dead ends: 3674 [2019-10-02 12:15:14,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-10-02 12:15:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3668. [2019-10-02 12:15:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3668 states. [2019-10-02 12:15:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 5616 transitions. [2019-10-02 12:15:14,275 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 5616 transitions. Word has length 198 [2019-10-02 12:15:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:14,276 INFO L475 AbstractCegarLoop]: Abstraction has 3668 states and 5616 transitions. [2019-10-02 12:15:14,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:15:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 5616 transitions. [2019-10-02 12:15:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:15:14,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:14,284 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:14,284 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash 170990014, now seen corresponding path program 1 times [2019-10-02 12:15:14,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:14,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:14,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:14,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:14,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:15:14,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:14,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:15:14,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:15:14,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:15:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:14,489 INFO L87 Difference]: Start difference. First operand 3668 states and 5616 transitions. Second operand 9 states. [2019-10-02 12:15:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:17,606 INFO L93 Difference]: Finished difference Result 7267 states and 11176 transitions. [2019-10-02 12:15:17,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:15:17,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2019-10-02 12:15:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:17,621 INFO L225 Difference]: With dead ends: 7267 [2019-10-02 12:15:17,621 INFO L226 Difference]: Without dead ends: 3674 [2019-10-02 12:15:17,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:15:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-10-02 12:15:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3668. [2019-10-02 12:15:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3668 states. [2019-10-02 12:15:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 5610 transitions. [2019-10-02 12:15:17,790 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 5610 transitions. Word has length 216 [2019-10-02 12:15:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:17,790 INFO L475 AbstractCegarLoop]: Abstraction has 3668 states and 5610 transitions. [2019-10-02 12:15:17,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:15:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 5610 transitions. [2019-10-02 12:15:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 12:15:17,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:17,795 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:17,795 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash 361948572, now seen corresponding path program 1 times [2019-10-02 12:15:17,795 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:17,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:17,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:17,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 12:15:17,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:17,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:15:17,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:15:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:15:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:15:17,948 INFO L87 Difference]: Start difference. First operand 3668 states and 5610 transitions. Second operand 6 states. [2019-10-02 12:15:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:21,621 INFO L93 Difference]: Finished difference Result 11652 states and 18381 transitions. [2019-10-02 12:15:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:15:21,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-10-02 12:15:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:21,662 INFO L225 Difference]: With dead ends: 11652 [2019-10-02 12:15:21,662 INFO L226 Difference]: Without dead ends: 8059 [2019-10-02 12:15:21,676 INFO L640 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-10-02 12:15:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8059 states. [2019-10-02 12:15:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8059 to 7656. [2019-10-02 12:15:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7656 states. [2019-10-02 12:15:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 11842 transitions. [2019-10-02 12:15:22,069 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 11842 transitions. Word has length 217 [2019-10-02 12:15:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:22,070 INFO L475 AbstractCegarLoop]: Abstraction has 7656 states and 11842 transitions. [2019-10-02 12:15:22,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 11842 transitions. [2019-10-02 12:15:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:15:22,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:22,075 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:22,076 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash 814425673, now seen corresponding path program 1 times [2019-10-02 12:15:22,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:22,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:22,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:22,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:15:22,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:22,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:22,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:22,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:22,228 INFO L87 Difference]: Start difference. First operand 7656 states and 11842 transitions. Second operand 4 states. [2019-10-02 12:15:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:24,400 INFO L93 Difference]: Finished difference Result 24049 states and 38492 transitions. [2019-10-02 12:15:24,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:15:24,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-10-02 12:15:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:24,496 INFO L225 Difference]: With dead ends: 24049 [2019-10-02 12:15:24,496 INFO L226 Difference]: Without dead ends: 16456 [2019-10-02 12:15:24,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16456 states. [2019-10-02 12:15:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16456 to 16272. [2019-10-02 12:15:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16272 states. [2019-10-02 12:15:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16272 states to 16272 states and 26056 transitions. [2019-10-02 12:15:26,570 INFO L78 Accepts]: Start accepts. Automaton has 16272 states and 26056 transitions. Word has length 225 [2019-10-02 12:15:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:26,571 INFO L475 AbstractCegarLoop]: Abstraction has 16272 states and 26056 transitions. [2019-10-02 12:15:26,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 16272 states and 26056 transitions. [2019-10-02 12:15:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 12:15:26,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:26,579 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:26,580 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -523916010, now seen corresponding path program 1 times [2019-10-02 12:15:26,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:26,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:26,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:15:26,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:26,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:26,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:26,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:26,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:26,784 INFO L87 Difference]: Start difference. First operand 16272 states and 26056 transitions. Second operand 4 states. [2019-10-02 12:15:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:29,702 INFO L93 Difference]: Finished difference Result 51915 states and 88009 transitions. [2019-10-02 12:15:29,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:15:29,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-10-02 12:15:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:29,927 INFO L225 Difference]: With dead ends: 51915 [2019-10-02 12:15:29,927 INFO L226 Difference]: Without dead ends: 35706 [2019-10-02 12:15:29,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35706 states. [2019-10-02 12:15:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35706 to 35291. [2019-10-02 12:15:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35291 states. [2019-10-02 12:15:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35291 states to 35291 states and 59788 transitions. [2019-10-02 12:15:32,110 INFO L78 Accepts]: Start accepts. Automaton has 35291 states and 59788 transitions. Word has length 226 [2019-10-02 12:15:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:32,110 INFO L475 AbstractCegarLoop]: Abstraction has 35291 states and 59788 transitions. [2019-10-02 12:15:32,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 35291 states and 59788 transitions. [2019-10-02 12:15:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:15:32,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:32,124 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:32,124 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash 937168683, now seen corresponding path program 1 times [2019-10-02 12:15:32,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:32,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:32,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:32,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:15:32,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:32,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:32,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:32,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:32,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:32,263 INFO L87 Difference]: Start difference. First operand 35291 states and 59788 transitions. Second operand 4 states. [2019-10-02 12:15:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:37,795 INFO L93 Difference]: Finished difference Result 114446 states and 212894 transitions. [2019-10-02 12:15:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:15:37,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-10-02 12:15:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:38,276 INFO L225 Difference]: With dead ends: 114446 [2019-10-02 12:15:38,276 INFO L226 Difference]: Without dead ends: 79218 [2019-10-02 12:15:38,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79218 states. [2019-10-02 12:15:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79218 to 78246. [2019-10-02 12:15:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78246 states. [2019-10-02 12:15:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78246 states to 78246 states and 144820 transitions. [2019-10-02 12:15:45,615 INFO L78 Accepts]: Start accepts. Automaton has 78246 states and 144820 transitions. Word has length 227 [2019-10-02 12:15:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:45,616 INFO L475 AbstractCegarLoop]: Abstraction has 78246 states and 144820 transitions. [2019-10-02 12:15:45,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 78246 states and 144820 transitions. [2019-10-02 12:15:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:15:45,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:45,632 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:45,633 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1013842184, now seen corresponding path program 1 times [2019-10-02 12:15:45,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:45,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:45,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:45,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:45,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:15:45,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:45,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:45,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:45,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:45,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:45,813 INFO L87 Difference]: Start difference. First operand 78246 states and 144820 transitions. Second operand 4 states. [2019-10-02 12:15:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:58,898 INFO L93 Difference]: Finished difference Result 258289 states and 554923 transitions. [2019-10-02 12:15:58,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:15:58,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-10-02 12:15:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:00,166 INFO L225 Difference]: With dead ends: 258289 [2019-10-02 12:16:00,166 INFO L226 Difference]: Without dead ends: 180106 [2019-10-02 12:16:00,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:16:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180106 states. [2019-10-02 12:16:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180106 to 177733. [2019-10-02 12:16:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177733 states. [2019-10-02 12:16:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177733 states to 177733 states and 376028 transitions. [2019-10-02 12:16:20,295 INFO L78 Accepts]: Start accepts. Automaton has 177733 states and 376028 transitions. Word has length 228 [2019-10-02 12:16:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:20,295 INFO L475 AbstractCegarLoop]: Abstraction has 177733 states and 376028 transitions. [2019-10-02 12:16:20,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 177733 states and 376028 transitions. [2019-10-02 12:16:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:16:20,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:20,316 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:20,316 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:20,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1365633011, now seen corresponding path program 1 times [2019-10-02 12:16:20,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:20,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:20,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:16:20,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:20,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:20,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:20,464 INFO L87 Difference]: Start difference. First operand 177733 states and 376028 transitions. Second operand 4 states. [2019-10-02 12:16:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:59,303 INFO L93 Difference]: Finished difference Result 597894 states and 1589907 transitions. [2019-10-02 12:16:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:16:59,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-10-02 12:16:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:04,076 INFO L225 Difference]: With dead ends: 597894 [2019-10-02 12:17:04,076 INFO L226 Difference]: Without dead ends: 420212 [2019-10-02 12:17:04,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:17:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420212 states. [2019-10-02 12:17:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420212 to 414164. [2019-10-02 12:17:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414164 states. [2019-10-02 12:18:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414164 states to 414164 states and 1064494 transitions. [2019-10-02 12:18:27,652 INFO L78 Accepts]: Start accepts. Automaton has 414164 states and 1064494 transitions. Word has length 229 [2019-10-02 12:18:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:27,653 INFO L475 AbstractCegarLoop]: Abstraction has 414164 states and 1064494 transitions. [2019-10-02 12:18:27,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:18:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 414164 states and 1064494 transitions. [2019-10-02 12:18:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-02 12:18:27,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:27,695 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:18:27,695 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:27,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2098297315, now seen corresponding path program 1 times [2019-10-02 12:18:27,696 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:27,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:27,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:27,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 12:18:27,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:18:27,876 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:18:27,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:28,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 3491 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:18:28,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:18:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 12:18:28,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:18:28,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-10-02 12:18:28,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:18:28,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:18:28,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:18:28,608 INFO L87 Difference]: Start difference. First operand 414164 states and 1064494 transitions. Second operand 14 states.