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_spec1_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:58:43,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:58:43,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:58:43,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:58:43,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:58:43,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:58:43,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:58:43,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:58:43,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:58:43,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:58:43,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:58:43,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:58:43,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:58:43,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:58:43,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:58:43,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:58:43,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:58:43,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:58:43,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:58:43,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:58:43,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:58:43,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:58:43,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:58:43,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:58:43,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:58:43,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:58:43,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:58:43,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:58:43,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:58:43,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:58:43,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:58:43,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:58:43,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:58:43,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:58:43,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:58:43,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:58:43,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:58:43,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:58:43,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:58:43,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:58:43,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:58:43,497 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 11:58:43,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:58:43,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:58:43,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:58:43,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:58:43,526 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:58:43,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:58:43,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:58:43,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:58:43,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:58:43,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:58:43,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:58:43,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:58:43,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:58:43,529 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:58:43,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:58:43,530 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:58:43,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:58:43,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:58:43,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:58:43,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:58:43,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:58:43,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:58:43,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:58:43,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:58:43,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:58:43,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:58:43,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:58:43,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:58:43,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:58:43,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:58:43,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:58:43,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:58:43,616 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:58:43,616 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:58:43,617 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product03.cil.c [2019-10-02 11:58:43,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4262775c7/d4a2dfbe9ec84923b69f99eb4f6255dc/FLAG2be4e98ee [2019-10-02 11:58:44,374 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:58:44,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product03.cil.c [2019-10-02 11:58:44,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4262775c7/d4a2dfbe9ec84923b69f99eb4f6255dc/FLAG2be4e98ee [2019-10-02 11:58:44,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4262775c7/d4a2dfbe9ec84923b69f99eb4f6255dc [2019-10-02 11:58:44,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:58:44,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:58:44,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:58:44,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:58:44,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:58:44,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:58:44" (1/1) ... [2019-10-02 11:58:44,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e54d529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:44, skipping insertion in model container [2019-10-02 11:58:44,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:58:44" (1/1) ... [2019-10-02 11:58:44,632 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:58:44,723 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:58:45,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:58:45,447 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:58:45,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:58:45,644 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:58:45,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45 WrapperNode [2019-10-02 11:58:45,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:58:45,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:58:45,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:58:45,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:58:45,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (1/1) ... [2019-10-02 11:58:45,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (1/1) ... [2019-10-02 11:58:45,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (1/1) ... [2019-10-02 11:58:45,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (1/1) ... [2019-10-02 11:58:45,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (1/1) ... [2019-10-02 11:58:45,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (1/1) ... [2019-10-02 11:58:45,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (1/1) ... [2019-10-02 11:58:45,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:58:45,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:58:45,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:58:45,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:58:45,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:58:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:58:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:58:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:58:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:58:45,970 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:58:45,970 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:58:45,970 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:58:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:58:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:58:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:58:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:58:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:58:45,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:58:45,973 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:58:45,974 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:58:45,974 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:58:45,976 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:58:45,976 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:58:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:58:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:58:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:58:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:58:45,978 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:58:45,978 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:58:45,978 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:58:45,978 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:58:45,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:58:45,979 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:58:45,979 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:58:45,979 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:58:45,979 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-10-02 11:58:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:58:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:58:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:58:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-02 11:58:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:58:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:58:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:58:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:58:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:58:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:58:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:58:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:58:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 11:58:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 11:58:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 11:58:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 11:58:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:58:45,983 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:58:45,983 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:58:45,983 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:58:45,983 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:58:45,983 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:58:45,984 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:58:45,984 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:58:45,984 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:58:45,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:58:45,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:58:45,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:58:45,985 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:58:45,985 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:58:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:58:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:58:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:58:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:58:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:58:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:58:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:58:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:58:45,988 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:58:45,988 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:58:45,988 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:58:45,988 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:58:45,988 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:58:45,989 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:58:45,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:58:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:58:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:58:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:58:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:58:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:58:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:58:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:58:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:58:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:58:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:58:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:58:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:58:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:58:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:58:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:58:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:58:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:58:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:58:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:58:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:58:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:58:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:58:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:58:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:58:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:58:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:58:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:58:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:58:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:58:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:58:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:58:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:58:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:58:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:58:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:58:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:58:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:58:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:58:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:58:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:58:46,000 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:58:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:58:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:58:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:58:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:58:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:58:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:58:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:58:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:58:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:58:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:58:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:58:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:58:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:58:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:58:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:58:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:58:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:58:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-10-02 11:58:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:58:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:58:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-02 11:58:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:58:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:58:46,010 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:58:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 11:58:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:58:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:58:46,020 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 11:58:46,020 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 11:58:46,020 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 11:58:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:58:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:58:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:58:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:58:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:58:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:58:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:58:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:58:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:58:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:58:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:58:46,023 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:58:46,023 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:58:46,023 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:58:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:58:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:58:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:58:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:58:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:58:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:58:48,451 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:58:48,452 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:58:48,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:58:48 BoogieIcfgContainer [2019-10-02 11:58:48,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:58:48,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:58:48,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:58:48,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:58:48,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:58:44" (1/3) ... [2019-10-02 11:58:48,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2a3e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:58:48, skipping insertion in model container [2019-10-02 11:58:48,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:58:45" (2/3) ... [2019-10-02 11:58:48,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2a3e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:58:48, skipping insertion in model container [2019-10-02 11:58:48,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:58:48" (3/3) ... [2019-10-02 11:58:48,465 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product03.cil.c [2019-10-02 11:58:48,476 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:58:48,491 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:58:48,509 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:58:48,556 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:58:48,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:58:48,557 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:58:48,557 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:58:48,557 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:58:48,557 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:58:48,558 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:58:48,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:58:48,558 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:58:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2019-10-02 11:58:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 11:58:48,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:48,634 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:48,636 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:48,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1215975064, now seen corresponding path program 1 times [2019-10-02 11:58:48,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:48,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:58:49,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:49,346 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 11:58:49,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:50,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 3256 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 11:58:50,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 11:58:50,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:50,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 11:58:50,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:58:50,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:58:50,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:58:50,202 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 4 states. [2019-10-02 11:58:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:50,377 INFO L93 Difference]: Finished difference Result 1184 states and 1921 transitions. [2019-10-02 11:58:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:58:50,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 11:58:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:50,404 INFO L225 Difference]: With dead ends: 1184 [2019-10-02 11:58:50,404 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:58:50,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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 11:58:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:58:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:58:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:58:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 954 transitions. [2019-10-02 11:58:50,530 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 954 transitions. Word has length 164 [2019-10-02 11:58:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:50,531 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 954 transitions. [2019-10-02 11:58:50,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:58:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 954 transitions. [2019-10-02 11:58:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 11:58:50,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:50,543 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:50,544 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash -569642611, now seen corresponding path program 1 times [2019-10-02 11:58:50,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:50,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:50,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:50,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:58:50,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:50,769 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 11:58:50,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:51,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 3261 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:51,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:58:51,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:51,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 11:58:51,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:58:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:58:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:58:51,487 INFO L87 Difference]: Start difference. First operand 596 states and 954 transitions. Second operand 5 states. [2019-10-02 11:58:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:51,665 INFO L93 Difference]: Finished difference Result 1646 states and 2683 transitions. [2019-10-02 11:58:51,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:58:51,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-10-02 11:58:51,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:51,676 INFO L225 Difference]: With dead ends: 1646 [2019-10-02 11:58:51,676 INFO L226 Difference]: Without dead ends: 1078 [2019-10-02 11:58:51,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:58:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-10-02 11:58:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1056. [2019-10-02 11:58:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-10-02 11:58:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1713 transitions. [2019-10-02 11:58:51,748 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1713 transitions. Word has length 168 [2019-10-02 11:58:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:51,748 INFO L475 AbstractCegarLoop]: Abstraction has 1056 states and 1713 transitions. [2019-10-02 11:58:51,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:58:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1713 transitions. [2019-10-02 11:58:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 11:58:51,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:51,755 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:51,755 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash -618683487, now seen corresponding path program 1 times [2019-10-02 11:58:51,756 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:51,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:51,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:51,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:51,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:58:51,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:51,891 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 11:58:52,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:52,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 3264 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:52,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:58:52,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:52,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:58:52,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:52,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:52,586 INFO L87 Difference]: Start difference. First operand 1056 states and 1713 transitions. Second operand 6 states. [2019-10-02 11:58:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:52,708 INFO L93 Difference]: Finished difference Result 2088 states and 3404 transitions. [2019-10-02 11:58:52,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:58:52,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-10-02 11:58:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:52,718 INFO L225 Difference]: With dead ends: 2088 [2019-10-02 11:58:52,718 INFO L226 Difference]: Without dead ends: 1062 [2019-10-02 11:58:52,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:58:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-10-02 11:58:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2019-10-02 11:58:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-02 11:58:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1718 transitions. [2019-10-02 11:58:52,787 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1718 transitions. Word has length 170 [2019-10-02 11:58:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:52,788 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1718 transitions. [2019-10-02 11:58:52,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1718 transitions. [2019-10-02 11:58:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 11:58:52,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:52,796 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:52,797 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:52,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1482424208, now seen corresponding path program 1 times [2019-10-02 11:58:52,797 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:52,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:52,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:58:52,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:52,953 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 11:58:53,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:53,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 3265 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:53,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:58:53,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:53,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:58:53,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:53,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:53,700 INFO L87 Difference]: Start difference. First operand 1062 states and 1718 transitions. Second operand 6 states. [2019-10-02 11:58:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:53,834 INFO L93 Difference]: Finished difference Result 2087 states and 3395 transitions. [2019-10-02 11:58:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:58:53,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-02 11:58:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:53,853 INFO L225 Difference]: With dead ends: 2087 [2019-10-02 11:58:53,854 INFO L226 Difference]: Without dead ends: 1062 [2019-10-02 11:58:53,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-10-02 11:58:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2019-10-02 11:58:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-02 11:58:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1717 transitions. [2019-10-02 11:58:53,918 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1717 transitions. Word has length 171 [2019-10-02 11:58:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:53,919 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1717 transitions. [2019-10-02 11:58:53,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1717 transitions. [2019-10-02 11:58:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 11:58:53,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:53,925 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:53,926 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:53,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:53,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1945680261, now seen corresponding path program 1 times [2019-10-02 11:58:53,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:53,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:53,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:53,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:58:54,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:54,096 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 11:58:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:54,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 3266 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:54,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:58:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:54,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:58:54,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:54,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:54,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:54,795 INFO L87 Difference]: Start difference. First operand 1062 states and 1717 transitions. Second operand 6 states. [2019-10-02 11:58:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:54,895 INFO L93 Difference]: Finished difference Result 2087 states and 3394 transitions. [2019-10-02 11:58:54,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:58:54,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-10-02 11:58:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:54,907 INFO L225 Difference]: With dead ends: 2087 [2019-10-02 11:58:54,907 INFO L226 Difference]: Without dead ends: 1062 [2019-10-02 11:58:54,917 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-10-02 11:58:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2019-10-02 11:58:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-02 11:58:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1716 transitions. [2019-10-02 11:58:54,967 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1716 transitions. Word has length 172 [2019-10-02 11:58:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:54,968 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1716 transitions. [2019-10-02 11:58:54,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1716 transitions. [2019-10-02 11:58:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 11:58:54,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:54,974 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:54,975 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 982032148, now seen corresponding path program 1 times [2019-10-02 11:58:54,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:54,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:54,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:54,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:54,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:58:55,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:55,203 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 11:58:55,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:55,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 3267 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:55,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:58:55,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:55,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 11:58:55,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:58:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:58:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:58:55,892 INFO L87 Difference]: Start difference. First operand 1062 states and 1716 transitions. Second operand 12 states. [2019-10-02 11:58:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:56,532 INFO L93 Difference]: Finished difference Result 2098 states and 3414 transitions. [2019-10-02 11:58:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:58:56,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 173 [2019-10-02 11:58:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:56,542 INFO L225 Difference]: With dead ends: 2098 [2019-10-02 11:58:56,542 INFO L226 Difference]: Without dead ends: 1071 [2019-10-02 11:58:56,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:58:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-02 11:58:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1069. [2019-10-02 11:58:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-02 11:58:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1721 transitions. [2019-10-02 11:58:56,592 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1721 transitions. Word has length 173 [2019-10-02 11:58:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:56,593 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1721 transitions. [2019-10-02 11:58:56,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:58:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1721 transitions. [2019-10-02 11:58:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 11:58:56,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:56,599 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:56,599 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash 665274798, now seen corresponding path program 1 times [2019-10-02 11:58:56,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:56,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:56,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:58:56,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:56,742 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 11:58:56,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:57,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 3270 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:57,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:58:57,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:57,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:58:57,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:58:57,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:58:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:57,386 INFO L87 Difference]: Start difference. First operand 1069 states and 1721 transitions. Second operand 8 states. [2019-10-02 11:58:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:57,732 INFO L93 Difference]: Finished difference Result 2099 states and 3404 transitions. [2019-10-02 11:58:57,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:58:57,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2019-10-02 11:58:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:57,743 INFO L225 Difference]: With dead ends: 2099 [2019-10-02 11:58:57,743 INFO L226 Difference]: Without dead ends: 1069 [2019-10-02 11:58:57,749 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:58:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2019-10-02 11:58:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2019-10-02 11:58:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-02 11:58:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1716 transitions. [2019-10-02 11:58:57,808 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1716 transitions. Word has length 176 [2019-10-02 11:58:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:57,808 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1716 transitions. [2019-10-02 11:58:57,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:58:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1716 transitions. [2019-10-02 11:58:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 11:58:57,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:57,814 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:57,814 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:57,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1466506635, now seen corresponding path program 1 times [2019-10-02 11:58:57,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:57,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:57,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:57,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:58:57,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:57,955 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:58,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:58,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 3270 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:58,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:58:58,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:58,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:58:58,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:58,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:58,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:58,743 INFO L87 Difference]: Start difference. First operand 1069 states and 1716 transitions. Second operand 6 states. [2019-10-02 11:58:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:59,139 INFO L93 Difference]: Finished difference Result 2135 states and 3450 transitions. [2019-10-02 11:58:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:58:59,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-10-02 11:58:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:59,150 INFO L225 Difference]: With dead ends: 2135 [2019-10-02 11:58:59,150 INFO L226 Difference]: Without dead ends: 1098 [2019-10-02 11:58:59,158 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 177 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 11:58:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-10-02 11:58:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1095. [2019-10-02 11:58:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-10-02 11:58:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1758 transitions. [2019-10-02 11:58:59,216 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1758 transitions. Word has length 177 [2019-10-02 11:58:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:59,219 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1758 transitions. [2019-10-02 11:58:59,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1758 transitions. [2019-10-02 11:58:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 11:58:59,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:59,226 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:58:59,226 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:59,226 INFO L82 PathProgramCache]: Analyzing trace with hash -293802614, now seen corresponding path program 1 times [2019-10-02 11:58:59,226 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:59,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:59,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:59,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:59,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:58:59,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:59,437 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:59,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:00,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:59:00,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:59:00,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:00,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 11:59:00,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:59:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:59:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:59:00,289 INFO L87 Difference]: Start difference. First operand 1095 states and 1758 transitions. Second operand 14 states. [2019-10-02 11:59:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:00,603 INFO L93 Difference]: Finished difference Result 2136 states and 3452 transitions. [2019-10-02 11:59:00,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:59:00,604 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 178 [2019-10-02 11:59:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:00,613 INFO L225 Difference]: With dead ends: 2136 [2019-10-02 11:59:00,613 INFO L226 Difference]: Without dead ends: 1089 [2019-10-02 11:59:00,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:59:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-02 11:59:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1084. [2019-10-02 11:59:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-10-02 11:59:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1738 transitions. [2019-10-02 11:59:00,665 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1738 transitions. Word has length 178 [2019-10-02 11:59:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:00,665 INFO L475 AbstractCegarLoop]: Abstraction has 1084 states and 1738 transitions. [2019-10-02 11:59:00,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:59:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1738 transitions. [2019-10-02 11:59:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 11:59:00,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:00,671 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:00,672 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash -415249184, now seen corresponding path program 1 times [2019-10-02 11:59:00,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:00,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:00,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:00,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:00,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:59:00,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:00,837 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:01,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 3275 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:59:01,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:59:01,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:01,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:59:01,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:59:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:59:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:59:01,475 INFO L87 Difference]: Start difference. First operand 1084 states and 1738 transitions. Second operand 8 states. [2019-10-02 11:59:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:01,779 INFO L93 Difference]: Finished difference Result 2122 states and 3430 transitions. [2019-10-02 11:59:01,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:59:01,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-10-02 11:59:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:01,788 INFO L225 Difference]: With dead ends: 2122 [2019-10-02 11:59:01,788 INFO L226 Difference]: Without dead ends: 1084 [2019-10-02 11:59:01,794 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:59:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-10-02 11:59:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2019-10-02 11:59:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-10-02 11:59:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1722 transitions. [2019-10-02 11:59:01,847 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1722 transitions. Word has length 181 [2019-10-02 11:59:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:01,847 INFO L475 AbstractCegarLoop]: Abstraction has 1084 states and 1722 transitions. [2019-10-02 11:59:01,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:59:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1722 transitions. [2019-10-02 11:59:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 11:59:01,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:01,853 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:01,853 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -504543874, now seen corresponding path program 1 times [2019-10-02 11:59:01,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:01,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:01,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:01,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:59:01,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:01,996 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:02,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:02,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 3276 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:59:02,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:59:02,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:02,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:59:02,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:59:02,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:59:02,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:59:02,615 INFO L87 Difference]: Start difference. First operand 1084 states and 1722 transitions. Second operand 8 states. [2019-10-02 11:59:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:02,883 INFO L93 Difference]: Finished difference Result 2118 states and 3390 transitions. [2019-10-02 11:59:02,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:59:02,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-10-02 11:59:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:02,892 INFO L225 Difference]: With dead ends: 2118 [2019-10-02 11:59:02,892 INFO L226 Difference]: Without dead ends: 1084 [2019-10-02 11:59:02,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:59:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-10-02 11:59:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2019-10-02 11:59:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-10-02 11:59:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1721 transitions. [2019-10-02 11:59:02,939 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1721 transitions. Word has length 182 [2019-10-02 11:59:02,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:02,940 INFO L475 AbstractCegarLoop]: Abstraction has 1084 states and 1721 transitions. [2019-10-02 11:59:02,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:59:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1721 transitions. [2019-10-02 11:59:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 11:59:02,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:02,945 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:02,946 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash -873829445, now seen corresponding path program 1 times [2019-10-02 11:59:02,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:02,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:02,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:02,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:02,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 11:59:03,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:03,213 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:03,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:03,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 3277 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:59:03,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 11:59:04,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:04,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 11:59:04,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:59:04,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:59:04,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:59:04,016 INFO L87 Difference]: Start difference. First operand 1084 states and 1721 transitions. Second operand 18 states. [2019-10-02 11:59:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:04,620 INFO L93 Difference]: Finished difference Result 2134 states and 3417 transitions. [2019-10-02 11:59:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:59:04,621 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-10-02 11:59:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:04,629 INFO L225 Difference]: With dead ends: 2134 [2019-10-02 11:59:04,629 INFO L226 Difference]: Without dead ends: 1099 [2019-10-02 11:59:04,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:59:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-10-02 11:59:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1095. [2019-10-02 11:59:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-10-02 11:59:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1729 transitions. [2019-10-02 11:59:04,672 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1729 transitions. Word has length 183 [2019-10-02 11:59:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:04,673 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1729 transitions. [2019-10-02 11:59:04,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:59:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1729 transitions. [2019-10-02 11:59:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 11:59:04,678 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:04,678 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:04,679 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 415243918, now seen corresponding path program 1 times [2019-10-02 11:59:04,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:04,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:04,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:04,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:04,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:59:04,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:04,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:59:04,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:59:04,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:59:04,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:59:04,847 INFO L87 Difference]: Start difference. First operand 1095 states and 1729 transitions. Second operand 9 states. [2019-10-02 11:59:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:05,040 INFO L93 Difference]: Finished difference Result 2050 states and 3293 transitions. [2019-10-02 11:59:05,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:59:05,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-10-02 11:59:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:05,050 INFO L225 Difference]: With dead ends: 2050 [2019-10-02 11:59:05,051 INFO L226 Difference]: Without dead ends: 1089 [2019-10-02 11:59:05,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:59:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-02 11:59:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2019-10-02 11:59:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-10-02 11:59:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1720 transitions. [2019-10-02 11:59:05,093 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1720 transitions. Word has length 184 [2019-10-02 11:59:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:05,093 INFO L475 AbstractCegarLoop]: Abstraction has 1089 states and 1720 transitions. [2019-10-02 11:59:05,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:59:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1720 transitions. [2019-10-02 11:59:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 11:59:05,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:05,098 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:05,099 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:05,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:05,099 INFO L82 PathProgramCache]: Analyzing trace with hash 422572558, now seen corresponding path program 1 times [2019-10-02 11:59:05,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:05,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:59:05,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:05,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:59:05,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:59:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:59:05,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:59:05,249 INFO L87 Difference]: Start difference. First operand 1089 states and 1720 transitions. Second operand 7 states. [2019-10-02 11:59:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:05,344 INFO L93 Difference]: Finished difference Result 2044 states and 3284 transitions. [2019-10-02 11:59:05,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:59:05,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-10-02 11:59:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:05,351 INFO L225 Difference]: With dead ends: 2044 [2019-10-02 11:59:05,352 INFO L226 Difference]: Without dead ends: 1059 [2019-10-02 11:59:05,356 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 11:59:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-10-02 11:59:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1057. [2019-10-02 11:59:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-10-02 11:59:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1678 transitions. [2019-10-02 11:59:05,393 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1678 transitions. Word has length 184 [2019-10-02 11:59:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:05,393 INFO L475 AbstractCegarLoop]: Abstraction has 1057 states and 1678 transitions. [2019-10-02 11:59:05,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:59:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1678 transitions. [2019-10-02 11:59:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 11:59:05,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:05,398 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:05,398 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash -495495307, now seen corresponding path program 1 times [2019-10-02 11:59:05,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:05,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:05,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:05,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:05,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 11:59:05,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:05,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:59:05,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:59:05,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:59:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:59:05,608 INFO L87 Difference]: Start difference. First operand 1057 states and 1678 transitions. Second operand 13 states. [2019-10-02 11:59:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:05,945 INFO L93 Difference]: Finished difference Result 2081 states and 3332 transitions. [2019-10-02 11:59:05,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:59:05,945 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-10-02 11:59:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:05,955 INFO L225 Difference]: With dead ends: 2081 [2019-10-02 11:59:05,955 INFO L226 Difference]: Without dead ends: 1071 [2019-10-02 11:59:05,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:59:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-02 11:59:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1069. [2019-10-02 11:59:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-02 11:59:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1693 transitions. [2019-10-02 11:59:05,993 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1693 transitions. Word has length 186 [2019-10-02 11:59:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:05,994 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1693 transitions. [2019-10-02 11:59:05,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:59:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1693 transitions. [2019-10-02 11:59:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 11:59:05,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:05,999 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:05,999 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2112609374, now seen corresponding path program 1 times [2019-10-02 11:59:05,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:06,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:06,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:06,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 11:59:06,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:06,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:59:06,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:59:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:59:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:59:06,254 INFO L87 Difference]: Start difference. First operand 1069 states and 1693 transitions. Second operand 13 states. [2019-10-02 11:59:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:06,597 INFO L93 Difference]: Finished difference Result 2025 states and 3255 transitions. [2019-10-02 11:59:06,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:59:06,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-10-02 11:59:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:06,604 INFO L225 Difference]: With dead ends: 2025 [2019-10-02 11:59:06,605 INFO L226 Difference]: Without dead ends: 1062 [2019-10-02 11:59:06,609 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:59:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-10-02 11:59:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2019-10-02 11:59:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-02 11:59:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1684 transitions. [2019-10-02 11:59:06,643 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1684 transitions. Word has length 185 [2019-10-02 11:59:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:06,645 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1684 transitions. [2019-10-02 11:59:06,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:59:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1684 transitions. [2019-10-02 11:59:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 11:59:06,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:06,649 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:06,650 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2098110983, now seen corresponding path program 1 times [2019-10-02 11:59:06,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:06,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:06,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:59:06,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:06,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:59:06,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:59:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:59:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:59:06,859 INFO L87 Difference]: Start difference. First operand 1062 states and 1684 transitions. Second operand 11 states. [2019-10-02 11:59:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:07,099 INFO L93 Difference]: Finished difference Result 2018 states and 3246 transitions. [2019-10-02 11:59:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:59:07,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-10-02 11:59:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:07,111 INFO L225 Difference]: With dead ends: 2018 [2019-10-02 11:59:07,111 INFO L226 Difference]: Without dead ends: 1062 [2019-10-02 11:59:07,121 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:59:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-10-02 11:59:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2019-10-02 11:59:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-02 11:59:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1683 transitions. [2019-10-02 11:59:07,159 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1683 transitions. Word has length 187 [2019-10-02 11:59:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:07,159 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1683 transitions. [2019-10-02 11:59:07,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:59:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1683 transitions. [2019-10-02 11:59:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 11:59:07,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:07,163 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:07,163 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:07,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:07,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1254310292, now seen corresponding path program 1 times [2019-10-02 11:59:07,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:07,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:07,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:07,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:59:07,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:07,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:59:07,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:59:07,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:59:07,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:59:07,395 INFO L87 Difference]: Start difference. First operand 1062 states and 1683 transitions. Second operand 11 states. [2019-10-02 11:59:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:07,675 INFO L93 Difference]: Finished difference Result 2067 states and 3303 transitions. [2019-10-02 11:59:07,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:59:07,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-10-02 11:59:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:07,682 INFO L225 Difference]: With dead ends: 2067 [2019-10-02 11:59:07,682 INFO L226 Difference]: Without dead ends: 1059 [2019-10-02 11:59:07,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:59:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-10-02 11:59:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2019-10-02 11:59:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-10-02 11:59:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1675 transitions. [2019-10-02 11:59:07,719 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1675 transitions. Word has length 188 [2019-10-02 11:59:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:07,719 INFO L475 AbstractCegarLoop]: Abstraction has 1059 states and 1675 transitions. [2019-10-02 11:59:07,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:59:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1675 transitions. [2019-10-02 11:59:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 11:59:07,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:07,723 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:07,723 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1113822658, now seen corresponding path program 1 times [2019-10-02 11:59:07,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:07,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:07,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:07,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:59:07,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:07,936 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:08,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:08,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:59:08,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:59:08,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:08,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 11:59:08,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:59:08,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:59:08,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:59:08,841 INFO L87 Difference]: Start difference. First operand 1059 states and 1675 transitions. Second operand 14 states. [2019-10-02 11:59:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:15,440 INFO L93 Difference]: Finished difference Result 2044 states and 3356 transitions. [2019-10-02 11:59:15,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:59:15,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2019-10-02 11:59:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:15,449 INFO L225 Difference]: With dead ends: 2044 [2019-10-02 11:59:15,449 INFO L226 Difference]: Without dead ends: 1097 [2019-10-02 11:59:15,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:59:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-10-02 11:59:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1093. [2019-10-02 11:59:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-10-02 11:59:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1751 transitions. [2019-10-02 11:59:15,494 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1751 transitions. Word has length 189 [2019-10-02 11:59:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:15,495 INFO L475 AbstractCegarLoop]: Abstraction has 1093 states and 1751 transitions. [2019-10-02 11:59:15,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:59:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1751 transitions. [2019-10-02 11:59:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 11:59:15,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:15,499 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:15,499 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1704717998, now seen corresponding path program 1 times [2019-10-02 11:59:15,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:15,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:15,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:15,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:15,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:59:15,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:15,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:59:15,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:59:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:59:15,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:59:15,688 INFO L87 Difference]: Start difference. First operand 1093 states and 1751 transitions. Second operand 6 states. [2019-10-02 11:59:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:16,366 INFO L93 Difference]: Finished difference Result 2088 states and 3448 transitions. [2019-10-02 11:59:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:59:16,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2019-10-02 11:59:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:16,375 INFO L225 Difference]: With dead ends: 2088 [2019-10-02 11:59:16,375 INFO L226 Difference]: Without dead ends: 1103 [2019-10-02 11:59:16,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:59:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-10-02 11:59:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2019-10-02 11:59:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2019-10-02 11:59:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1753 transitions. [2019-10-02 11:59:16,424 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1753 transitions. Word has length 191 [2019-10-02 11:59:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:16,424 INFO L475 AbstractCegarLoop]: Abstraction has 1103 states and 1753 transitions. [2019-10-02 11:59:16,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:59:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1753 transitions. [2019-10-02 11:59:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 11:59:16,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:16,428 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:16,428 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1672668957, now seen corresponding path program 1 times [2019-10-02 11:59:16,429 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:16,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:16,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:16,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:59:16,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:16,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:59:16,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:59:16,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:59:16,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:59:16,612 INFO L87 Difference]: Start difference. First operand 1103 states and 1753 transitions. Second operand 7 states. [2019-10-02 11:59:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:16,680 INFO L93 Difference]: Finished difference Result 2106 states and 3412 transitions. [2019-10-02 11:59:16,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:59:16,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2019-10-02 11:59:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:16,689 INFO L225 Difference]: With dead ends: 2106 [2019-10-02 11:59:16,689 INFO L226 Difference]: Without dead ends: 1115 [2019-10-02 11:59:16,695 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 11:59:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-10-02 11:59:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1107. [2019-10-02 11:59:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1107 states. [2019-10-02 11:59:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1757 transitions. [2019-10-02 11:59:16,743 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1757 transitions. Word has length 195 [2019-10-02 11:59:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:16,744 INFO L475 AbstractCegarLoop]: Abstraction has 1107 states and 1757 transitions. [2019-10-02 11:59:16,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:59:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1757 transitions. [2019-10-02 11:59:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 11:59:16,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:16,748 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:16,748 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2133538238, now seen corresponding path program 1 times [2019-10-02 11:59:16,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:16,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:16,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:16,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:16,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:59:16,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:16,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:59:16,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:59:16,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:59:16,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:59:16,972 INFO L87 Difference]: Start difference. First operand 1107 states and 1757 transitions. Second operand 6 states. [2019-10-02 11:59:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:17,618 INFO L93 Difference]: Finished difference Result 2118 states and 3458 transitions. [2019-10-02 11:59:17,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:59:17,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-10-02 11:59:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:17,630 INFO L225 Difference]: With dead ends: 2118 [2019-10-02 11:59:17,631 INFO L226 Difference]: Without dead ends: 1119 [2019-10-02 11:59:17,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:59:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-10-02 11:59:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2019-10-02 11:59:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-10-02 11:59:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1761 transitions. [2019-10-02 11:59:17,678 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1761 transitions. Word has length 193 [2019-10-02 11:59:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:17,678 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1761 transitions. [2019-10-02 11:59:17,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:59:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1761 transitions. [2019-10-02 11:59:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 11:59:17,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:17,682 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:17,682 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:17,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:17,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1066717002, now seen corresponding path program 1 times [2019-10-02 11:59:17,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:17,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:17,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:17,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 11:59:17,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:17,879 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:17,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:18,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 3289 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:59:18,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:59:18,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:18,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 11:59:18,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:59:18,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:59:18,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:59:18,675 INFO L87 Difference]: Start difference. First operand 1119 states and 1761 transitions. Second operand 14 states. [2019-10-02 11:59:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:30,107 INFO L93 Difference]: Finished difference Result 3339 states and 5441 transitions. [2019-10-02 11:59:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:59:30,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 195 [2019-10-02 11:59:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:30,126 INFO L225 Difference]: With dead ends: 3339 [2019-10-02 11:59:30,126 INFO L226 Difference]: Without dead ends: 2332 [2019-10-02 11:59:30,134 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:59:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2019-10-02 11:59:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2293. [2019-10-02 11:59:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-10-02 11:59:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3679 transitions. [2019-10-02 11:59:30,255 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3679 transitions. Word has length 195 [2019-10-02 11:59:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:30,256 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 3679 transitions. [2019-10-02 11:59:30,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:59:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3679 transitions. [2019-10-02 11:59:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 11:59:30,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:30,264 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:30,264 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash 689118402, now seen corresponding path program 1 times [2019-10-02 11:59:30,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:30,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:30,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:30,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:30,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:59:30,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:30,597 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:30,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:31,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:59:31,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 11:59:31,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:31,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 11:59:31,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:59:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:59:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:59:31,289 INFO L87 Difference]: Start difference. First operand 2293 states and 3679 transitions. Second operand 14 states. [2019-10-02 11:59:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:42,549 INFO L93 Difference]: Finished difference Result 5736 states and 9350 transitions. [2019-10-02 11:59:42,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 11:59:42,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2019-10-02 11:59:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:42,573 INFO L225 Difference]: With dead ends: 5736 [2019-10-02 11:59:42,573 INFO L226 Difference]: Without dead ends: 3564 [2019-10-02 11:59:42,583 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 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 11:59:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-10-02 11:59:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3443. [2019-10-02 11:59:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2019-10-02 11:59:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 5547 transitions. [2019-10-02 11:59:42,749 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 5547 transitions. Word has length 197 [2019-10-02 11:59:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:42,750 INFO L475 AbstractCegarLoop]: Abstraction has 3443 states and 5547 transitions. [2019-10-02 11:59:42,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:59:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 5547 transitions. [2019-10-02 11:59:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 11:59:42,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:42,760 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:42,760 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash -462850824, now seen corresponding path program 1 times [2019-10-02 11:59:42,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:42,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:42,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:59:43,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:43,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:59:43,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:59:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:59:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:59:43,026 INFO L87 Difference]: Start difference. First operand 3443 states and 5547 transitions. Second operand 9 states. [2019-10-02 11:59:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:43,290 INFO L93 Difference]: Finished difference Result 4471 states and 7207 transitions. [2019-10-02 11:59:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:59:43,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-10-02 11:59:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:43,303 INFO L225 Difference]: With dead ends: 4471 [2019-10-02 11:59:43,303 INFO L226 Difference]: Without dead ends: 1129 [2019-10-02 11:59:43,315 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 11:59:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-10-02 11:59:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2019-10-02 11:59:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-10-02 11:59:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1768 transitions. [2019-10-02 11:59:43,367 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1768 transitions. Word has length 205 [2019-10-02 11:59:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:43,367 INFO L475 AbstractCegarLoop]: Abstraction has 1129 states and 1768 transitions. [2019-10-02 11:59:43,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:59:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1768 transitions. [2019-10-02 11:59:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 11:59:43,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:43,371 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:43,371 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -440186926, now seen corresponding path program 1 times [2019-10-02 11:59:43,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:43,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:43,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:43,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:59:43,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:43,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:43,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:44,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 3326 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:59:44,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:59:44,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:44,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 11:59:44,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:59:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:59:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:59:44,279 INFO L87 Difference]: Start difference. First operand 1129 states and 1768 transitions. Second operand 14 states. [2019-10-02 11:59:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:50,794 INFO L93 Difference]: Finished difference Result 2248 states and 3594 transitions. [2019-10-02 11:59:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:59:50,795 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2019-10-02 11:59:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:50,802 INFO L225 Difference]: With dead ends: 2248 [2019-10-02 11:59:50,802 INFO L226 Difference]: Without dead ends: 1229 [2019-10-02 11:59:50,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 226 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 11:59:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-10-02 11:59:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1217. [2019-10-02 11:59:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-10-02 11:59:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1911 transitions. [2019-10-02 11:59:50,863 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1911 transitions. Word has length 209 [2019-10-02 11:59:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:50,863 INFO L475 AbstractCegarLoop]: Abstraction has 1217 states and 1911 transitions. [2019-10-02 11:59:50,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:59:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1911 transitions. [2019-10-02 11:59:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 11:59:50,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:50,868 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:50,868 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1305993516, now seen corresponding path program 1 times [2019-10-02 11:59:50,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:50,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:50,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:50,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:50,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:59:51,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:51,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:59:51,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:59:51,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:59:51,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:59:51,075 INFO L87 Difference]: Start difference. First operand 1217 states and 1911 transitions. Second operand 11 states. [2019-10-02 11:59:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:55,621 INFO L93 Difference]: Finished difference Result 2324 states and 3714 transitions. [2019-10-02 11:59:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:59:55,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2019-10-02 11:59:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:55,628 INFO L225 Difference]: With dead ends: 2324 [2019-10-02 11:59:55,629 INFO L226 Difference]: Without dead ends: 1217 [2019-10-02 11:59:55,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 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 11:59:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-10-02 11:59:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1203. [2019-10-02 11:59:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-10-02 11:59:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1891 transitions. [2019-10-02 11:59:55,687 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1891 transitions. Word has length 216 [2019-10-02 11:59:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:55,688 INFO L475 AbstractCegarLoop]: Abstraction has 1203 states and 1891 transitions. [2019-10-02 11:59:55,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:59:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1891 transitions. [2019-10-02 11:59:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 11:59:55,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:55,692 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:59:55,692 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:55,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:55,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1322134087, now seen corresponding path program 1 times [2019-10-02 11:59:55,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:55,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:55,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:55,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 11:59:55,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:55,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:59:55,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:59:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:59:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:59:55,893 INFO L87 Difference]: Start difference. First operand 1203 states and 1891 transitions. Second operand 9 states. [2019-10-02 12:00:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:01,343 INFO L93 Difference]: Finished difference Result 2531 states and 4024 transitions. [2019-10-02 12:00:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:00:01,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-10-02 12:00:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:01,354 INFO L225 Difference]: With dead ends: 2531 [2019-10-02 12:00:01,354 INFO L226 Difference]: Without dead ends: 1438 [2019-10-02 12:00:01,359 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:00:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2019-10-02 12:00:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1320. [2019-10-02 12:00:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-10-02 12:00:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2056 transitions. [2019-10-02 12:00:01,425 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2056 transitions. Word has length 218 [2019-10-02 12:00:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:01,426 INFO L475 AbstractCegarLoop]: Abstraction has 1320 states and 2056 transitions. [2019-10-02 12:00:01,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:00:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2056 transitions. [2019-10-02 12:00:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 12:00:01,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:01,430 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:00:01,430 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash -590426409, now seen corresponding path program 1 times [2019-10-02 12:00:01,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:01,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:01,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:01,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:01,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:00:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:00:01,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:00:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:00:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:00:01,634 INFO L87 Difference]: Start difference. First operand 1320 states and 2056 transitions. Second operand 7 states. [2019-10-02 12:00:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:01,733 INFO L93 Difference]: Finished difference Result 2573 states and 4056 transitions. [2019-10-02 12:00:01,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:00:01,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-10-02 12:00:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:01,740 INFO L225 Difference]: With dead ends: 2573 [2019-10-02 12:00:01,741 INFO L226 Difference]: Without dead ends: 1363 [2019-10-02 12:00:01,745 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:00:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-10-02 12:00:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1341. [2019-10-02 12:00:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2019-10-02 12:00:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2080 transitions. [2019-10-02 12:00:01,819 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2080 transitions. Word has length 223 [2019-10-02 12:00:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:01,820 INFO L475 AbstractCegarLoop]: Abstraction has 1341 states and 2080 transitions. [2019-10-02 12:00:01,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:00:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2080 transitions. [2019-10-02 12:00:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:00:01,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:01,824 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:00:01,824 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1544216127, now seen corresponding path program 1 times [2019-10-02 12:00:01,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:01,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:00:02,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:02,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:00:02,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:00:02,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:00:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:02,118 INFO L87 Difference]: Start difference. First operand 1341 states and 2080 transitions. Second operand 8 states. [2019-10-02 12:00:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:06,530 INFO L93 Difference]: Finished difference Result 4163 states and 6617 transitions. [2019-10-02 12:00:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:00:06,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-10-02 12:00:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:06,546 INFO L225 Difference]: With dead ends: 4163 [2019-10-02 12:00:06,546 INFO L226 Difference]: Without dead ends: 2930 [2019-10-02 12:00:06,552 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:00:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-10-02 12:00:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2893. [2019-10-02 12:00:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-10-02 12:00:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 4526 transitions. [2019-10-02 12:00:06,692 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 4526 transitions. Word has length 227 [2019-10-02 12:00:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:06,693 INFO L475 AbstractCegarLoop]: Abstraction has 2893 states and 4526 transitions. [2019-10-02 12:00:06,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:00:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 4526 transitions. [2019-10-02 12:00:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:00:06,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:06,697 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:00:06,698 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:06,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash 25182243, now seen corresponding path program 1 times [2019-10-02 12:00:06,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:06,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:06,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:06,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:00:06,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:06,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:00:06,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:00:06,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:00:06,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:00:06,898 INFO L87 Difference]: Start difference. First operand 2893 states and 4526 transitions. Second operand 9 states. [2019-10-02 12:00:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:07,255 INFO L93 Difference]: Finished difference Result 5615 states and 8964 transitions. [2019-10-02 12:00:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:00:07,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-02 12:00:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:07,269 INFO L225 Difference]: With dead ends: 5615 [2019-10-02 12:00:07,269 INFO L226 Difference]: Without dead ends: 2893 [2019-10-02 12:00:07,277 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:00:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2019-10-02 12:00:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2893. [2019-10-02 12:00:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-10-02 12:00:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 4480 transitions. [2019-10-02 12:00:07,467 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 4480 transitions. Word has length 230 [2019-10-02 12:00:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:07,468 INFO L475 AbstractCegarLoop]: Abstraction has 2893 states and 4480 transitions. [2019-10-02 12:00:07,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:00:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 4480 transitions. [2019-10-02 12:00:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 12:00:07,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:07,472 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:00:07,472 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:07,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 916606716, now seen corresponding path program 1 times [2019-10-02 12:00:07,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:07,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:07,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:07,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:07,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:00:07,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:07,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:00:07,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:00:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:00:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:00:07,645 INFO L87 Difference]: Start difference. First operand 2893 states and 4480 transitions. Second operand 7 states. [2019-10-02 12:00:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:12,073 INFO L93 Difference]: Finished difference Result 5408 states and 8435 transitions. [2019-10-02 12:00:12,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:00:12,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-10-02 12:00:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:12,087 INFO L225 Difference]: With dead ends: 5408 [2019-10-02 12:00:12,087 INFO L226 Difference]: Without dead ends: 3076 [2019-10-02 12:00:12,093 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:00:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2019-10-02 12:00:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 3009. [2019-10-02 12:00:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3009 states. [2019-10-02 12:00:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 4637 transitions. [2019-10-02 12:00:12,216 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 4637 transitions. Word has length 235 [2019-10-02 12:00:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:12,216 INFO L475 AbstractCegarLoop]: Abstraction has 3009 states and 4637 transitions. [2019-10-02 12:00:12,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:00:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 4637 transitions. [2019-10-02 12:00:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:00:12,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:12,220 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:00:12,220 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash -477193967, now seen corresponding path program 1 times [2019-10-02 12:00:12,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:12,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:12,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:12,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:00:12,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:12,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:00:12,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:00:12,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:00:12,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:00:12,380 INFO L87 Difference]: Start difference. First operand 3009 states and 4637 transitions. Second operand 8 states. [2019-10-02 12:00:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:12,590 INFO L93 Difference]: Finished difference Result 3032 states and 4666 transitions. [2019-10-02 12:00:12,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:00:12,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-10-02 12:00:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:12,601 INFO L225 Difference]: With dead ends: 3032 [2019-10-02 12:00:12,601 INFO L226 Difference]: Without dead ends: 3015 [2019-10-02 12:00:12,604 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:00:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2019-10-02 12:00:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3009. [2019-10-02 12:00:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3009 states. [2019-10-02 12:00:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 4632 transitions. [2019-10-02 12:00:12,753 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 4632 transitions. Word has length 240 [2019-10-02 12:00:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:12,753 INFO L475 AbstractCegarLoop]: Abstraction has 3009 states and 4632 transitions. [2019-10-02 12:00:12,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:00:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 4632 transitions. [2019-10-02 12:00:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 12:00:12,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:12,757 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:00:12,758 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:12,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:12,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1685632029, now seen corresponding path program 1 times [2019-10-02 12:00:12,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:12,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:12,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 12:00:12,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:12,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:00:12,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:00:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:00:12,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:00:12,951 INFO L87 Difference]: Start difference. First operand 3009 states and 4632 transitions. Second operand 9 states. [2019-10-02 12:00:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:16,212 INFO L93 Difference]: Finished difference Result 5946 states and 9213 transitions. [2019-10-02 12:00:16,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:00:16,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2019-10-02 12:00:16,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:16,225 INFO L225 Difference]: With dead ends: 5946 [2019-10-02 12:00:16,226 INFO L226 Difference]: Without dead ends: 3059 [2019-10-02 12:00:16,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 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:00:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2019-10-02 12:00:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 3029. [2019-10-02 12:00:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3029 states. [2019-10-02 12:00:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 4656 transitions. [2019-10-02 12:00:16,384 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 4656 transitions. Word has length 258 [2019-10-02 12:00:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:16,384 INFO L475 AbstractCegarLoop]: Abstraction has 3029 states and 4656 transitions. [2019-10-02 12:00:16,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:00:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 4656 transitions. [2019-10-02 12:00:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 12:00:16,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:16,389 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-10-02 12:00:16,389 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:16,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:16,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1387289244, now seen corresponding path program 1 times [2019-10-02 12:00:16,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:16,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:16,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:16,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:16,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:16,552 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:00:16,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:16,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:00:16,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:00:16,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:00:16,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:00:16,554 INFO L87 Difference]: Start difference. First operand 3029 states and 4656 transitions. Second operand 6 states. [2019-10-02 12:00:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:20,269 INFO L93 Difference]: Finished difference Result 9364 states and 14793 transitions. [2019-10-02 12:00:20,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:00:20,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-10-02 12:00:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:20,303 INFO L225 Difference]: With dead ends: 9364 [2019-10-02 12:00:20,303 INFO L226 Difference]: Without dead ends: 6457 [2019-10-02 12:00:20,316 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:00:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2019-10-02 12:00:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 6118. [2019-10-02 12:00:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6118 states. [2019-10-02 12:00:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6118 states to 6118 states and 9473 transitions. [2019-10-02 12:00:20,607 INFO L78 Accepts]: Start accepts. Automaton has 6118 states and 9473 transitions. Word has length 259 [2019-10-02 12:00:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:20,608 INFO L475 AbstractCegarLoop]: Abstraction has 6118 states and 9473 transitions. [2019-10-02 12:00:20,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:00:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6118 states and 9473 transitions. [2019-10-02 12:00:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 12:00:20,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:20,612 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-10-02 12:00:20,612 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1313358109, now seen corresponding path program 1 times [2019-10-02 12:00:20,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:20,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:20,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 12:00:20,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:20,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:00:20,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:00:20,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:00:20,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:00:20,747 INFO L87 Difference]: Start difference. First operand 6118 states and 9473 transitions. Second operand 4 states. [2019-10-02 12:00:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:21,033 INFO L93 Difference]: Finished difference Result 12122 states and 18949 transitions. [2019-10-02 12:00:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:00:21,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-10-02 12:00:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:21,064 INFO L225 Difference]: With dead ends: 12122 [2019-10-02 12:00:21,064 INFO L226 Difference]: Without dead ends: 6038 [2019-10-02 12:00:21,082 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:00:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2019-10-02 12:00:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 6034. [2019-10-02 12:00:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6034 states. [2019-10-02 12:00:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6034 states to 6034 states and 9315 transitions. [2019-10-02 12:00:21,406 INFO L78 Accepts]: Start accepts. Automaton has 6034 states and 9315 transitions. Word has length 261 [2019-10-02 12:00:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:21,407 INFO L475 AbstractCegarLoop]: Abstraction has 6034 states and 9315 transitions. [2019-10-02 12:00:21,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:00:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6034 states and 9315 transitions. [2019-10-02 12:00:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-02 12:00:21,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:21,412 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-10-02 12:00:21,413 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:21,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:21,413 INFO L82 PathProgramCache]: Analyzing trace with hash -53603671, now seen corresponding path program 1 times [2019-10-02 12:00:21,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:21,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 12:00:21,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:00:21,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:00:21,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:00:21,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:00:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:00:21,697 INFO L87 Difference]: Start difference. First operand 6034 states and 9315 transitions. Second operand 4 states. [2019-10-02 12:00:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:22,439 INFO L93 Difference]: Finished difference Result 11921 states and 18554 transitions. [2019-10-02 12:00:22,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:00:22,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-10-02 12:00:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:22,461 INFO L225 Difference]: With dead ends: 11921 [2019-10-02 12:00:22,461 INFO L226 Difference]: Without dead ends: 5997 [2019-10-02 12:00:22,474 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:00:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2019-10-02 12:00:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 5997. [2019-10-02 12:00:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5997 states. [2019-10-02 12:00:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5997 states to 5997 states and 9241 transitions. [2019-10-02 12:00:22,719 INFO L78 Accepts]: Start accepts. Automaton has 5997 states and 9241 transitions. Word has length 267 [2019-10-02 12:00:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:22,719 INFO L475 AbstractCegarLoop]: Abstraction has 5997 states and 9241 transitions. [2019-10-02 12:00:22,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:00:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5997 states and 9241 transitions. [2019-10-02 12:00:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 12:00:22,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:22,725 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-10-02 12:00:22,725 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1661976464, now seen corresponding path program 1 times [2019-10-02 12:00:22,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:22,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:22,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 12:00:22,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:22,967 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:23,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:23,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 3492 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 12:00:23,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:23,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 12:00:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 12:00:23,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:23,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 12:00:23,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:00:23,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:00:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:00:23,724 INFO L87 Difference]: Start difference. First operand 5997 states and 9241 transitions. Second operand 16 states. [2019-10-02 12:00:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:32,495 INFO L93 Difference]: Finished difference Result 12744 states and 19714 transitions. [2019-10-02 12:00:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 12:00:32,496 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 268 [2019-10-02 12:00:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:32,523 INFO L225 Difference]: With dead ends: 12744 [2019-10-02 12:00:32,523 INFO L226 Difference]: Without dead ends: 7776 [2019-10-02 12:00:32,536 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1336, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:00:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states. [2019-10-02 12:00:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7776 to 7644. [2019-10-02 12:00:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7644 states. [2019-10-02 12:00:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 11676 transitions. [2019-10-02 12:00:33,578 INFO L78 Accepts]: Start accepts. Automaton has 7644 states and 11676 transitions. Word has length 268 [2019-10-02 12:00:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:33,578 INFO L475 AbstractCegarLoop]: Abstraction has 7644 states and 11676 transitions. [2019-10-02 12:00:33,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:00:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7644 states and 11676 transitions. [2019-10-02 12:00:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-02 12:00:33,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:33,585 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:00:33,586 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1142105399, now seen corresponding path program 1 times [2019-10-02 12:00:33,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:33,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:33,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-10-02 12:00:33,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:33,845 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:33,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:34,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 4278 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:00:34,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-10-02 12:00:34,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:00:34,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:00:34,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:00:34,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:00:34,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:00:34,750 INFO L87 Difference]: Start difference. First operand 7644 states and 11676 transitions. Second operand 15 states. [2019-10-02 12:00:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:50,315 INFO L93 Difference]: Finished difference Result 29219 states and 46686 transitions. [2019-10-02 12:00:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 12:00:50,316 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 393 [2019-10-02 12:00:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:50,418 INFO L225 Difference]: With dead ends: 29219 [2019-10-02 12:00:50,418 INFO L226 Difference]: Without dead ends: 21659 [2019-10-02 12:00:50,454 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=569, Invalid=2293, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 12:00:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21659 states. [2019-10-02 12:00:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21659 to 21435. [2019-10-02 12:00:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21435 states. [2019-10-02 12:00:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21435 states to 21435 states and 33325 transitions. [2019-10-02 12:00:51,304 INFO L78 Accepts]: Start accepts. Automaton has 21435 states and 33325 transitions. Word has length 393 [2019-10-02 12:00:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:51,305 INFO L475 AbstractCegarLoop]: Abstraction has 21435 states and 33325 transitions. [2019-10-02 12:00:51,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:00:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 21435 states and 33325 transitions. [2019-10-02 12:00:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-10-02 12:00:51,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:51,310 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:00:51,311 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash -350436736, now seen corresponding path program 1 times [2019-10-02 12:00:51,311 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:51,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:51,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:51,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:51,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-02 12:00:51,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:51,757 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:51,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:52,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 4298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:00:52,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-02 12:00:52,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:52,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-02 12:00:52,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:00:52,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:00:52,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:00:52,654 INFO L87 Difference]: Start difference. First operand 21435 states and 33325 transitions. Second operand 11 states. [2019-10-02 12:01:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:02,344 INFO L93 Difference]: Finished difference Result 45854 states and 73415 transitions. [2019-10-02 12:01:02,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:01:02,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 399 [2019-10-02 12:01:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:02,464 INFO L225 Difference]: With dead ends: 45854 [2019-10-02 12:01:02,464 INFO L226 Difference]: Without dead ends: 24533 [2019-10-02 12:01:02,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-10-02 12:01:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24533 states. [2019-10-02 12:01:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24533 to 23155. [2019-10-02 12:01:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23155 states. [2019-10-02 12:01:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23155 states to 23155 states and 36405 transitions. [2019-10-02 12:01:04,811 INFO L78 Accepts]: Start accepts. Automaton has 23155 states and 36405 transitions. Word has length 399 [2019-10-02 12:01:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:04,812 INFO L475 AbstractCegarLoop]: Abstraction has 23155 states and 36405 transitions. [2019-10-02 12:01:04,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:01:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23155 states and 36405 transitions. [2019-10-02 12:01:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 12:01:04,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:04,817 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:01:04,817 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1001471118, now seen corresponding path program 1 times [2019-10-02 12:01:04,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:04,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:04,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:04,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:04,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 12:01:05,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:05,046 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:05,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 3573 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:01:05,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 12:01:05,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:01:05,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:01:05,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:01:05,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:01:05,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:01:05,872 INFO L87 Difference]: Start difference. First operand 23155 states and 36405 transitions. Second operand 19 states. [2019-10-02 12:01:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:16,414 INFO L93 Difference]: Finished difference Result 71933 states and 114166 transitions. [2019-10-02 12:01:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:01:16,414 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 302 [2019-10-02 12:01:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:16,757 INFO L225 Difference]: With dead ends: 71933 [2019-10-02 12:01:16,757 INFO L226 Difference]: Without dead ends: 48876 [2019-10-02 12:01:16,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:01:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48876 states. [2019-10-02 12:01:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48876 to 48686. [2019-10-02 12:01:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48686 states. [2019-10-02 12:01:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48686 states to 48686 states and 77508 transitions. [2019-10-02 12:01:19,076 INFO L78 Accepts]: Start accepts. Automaton has 48686 states and 77508 transitions. Word has length 302 [2019-10-02 12:01:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:19,077 INFO L475 AbstractCegarLoop]: Abstraction has 48686 states and 77508 transitions. [2019-10-02 12:01:19,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:01:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 48686 states and 77508 transitions. [2019-10-02 12:01:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-10-02 12:01:19,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:19,082 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:01:19,082 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1738725707, now seen corresponding path program 1 times [2019-10-02 12:01:19,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:19,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:19,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:19,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-10-02 12:01:19,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:19,714 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:19,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:20,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 4304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:01:20,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 12:01:20,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:01:20,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 12:01:20,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:01:20,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:01:20,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:01:20,569 INFO L87 Difference]: Start difference. First operand 48686 states and 77508 transitions. Second operand 9 states. [2019-10-02 12:01:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:25,141 INFO L93 Difference]: Finished difference Result 100378 states and 162044 transitions. [2019-10-02 12:01:25,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:01:25,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 404 [2019-10-02 12:01:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:25,410 INFO L225 Difference]: With dead ends: 100378 [2019-10-02 12:01:25,410 INFO L226 Difference]: Without dead ends: 51806 [2019-10-02 12:01:25,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:01:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51806 states. [2019-10-02 12:01:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51806 to 51806. [2019-10-02 12:01:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51806 states. [2019-10-02 12:01:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51806 states to 51806 states and 83268 transitions. [2019-10-02 12:01:27,862 INFO L78 Accepts]: Start accepts. Automaton has 51806 states and 83268 transitions. Word has length 404 [2019-10-02 12:01:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:27,863 INFO L475 AbstractCegarLoop]: Abstraction has 51806 states and 83268 transitions. [2019-10-02 12:01:27,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:01:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 51806 states and 83268 transitions. [2019-10-02 12:01:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-10-02 12:01:27,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:27,868 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:01:27,868 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash 869381396, now seen corresponding path program 1 times [2019-10-02 12:01:27,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:27,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:27,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-02 12:01:28,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:28,127 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:01:28,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:28,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 4308 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:01:28,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:01:29,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:01:29,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:01:29,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:01:29,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:01:29,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:01:29,114 INFO L87 Difference]: Start difference. First operand 51806 states and 83268 transitions. Second operand 15 states. [2019-10-02 12:01:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:48,915 INFO L93 Difference]: Finished difference Result 197794 states and 326733 transitions. [2019-10-02 12:01:48,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:01:48,916 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 409 [2019-10-02 12:01:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:49,623 INFO L225 Difference]: With dead ends: 197794 [2019-10-02 12:01:49,623 INFO L226 Difference]: Without dead ends: 145696 [2019-10-02 12:01:49,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:01:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145696 states. [2019-10-02 12:01:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145696 to 145214. [2019-10-02 12:01:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145214 states. [2019-10-02 12:01:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145214 states to 145214 states and 235109 transitions. [2019-10-02 12:01:59,817 INFO L78 Accepts]: Start accepts. Automaton has 145214 states and 235109 transitions. Word has length 409 [2019-10-02 12:01:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:59,818 INFO L475 AbstractCegarLoop]: Abstraction has 145214 states and 235109 transitions. [2019-10-02 12:01:59,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:01:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 145214 states and 235109 transitions. [2019-10-02 12:01:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-10-02 12:01:59,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:59,822 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:01:59,822 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash 79818218, now seen corresponding path program 1 times [2019-10-02 12:01:59,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:59,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 49 proven. 16 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-02 12:02:00,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:00,082 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:02:00,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:00,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 4037 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:02:00,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-10-02 12:02:00,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:02:00,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:02:00,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:02:00,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:02:00,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:02:00,844 INFO L87 Difference]: Start difference. First operand 145214 states and 235109 transitions. Second operand 12 states. [2019-10-02 12:02:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:32,514 INFO L93 Difference]: Finished difference Result 471255 states and 800229 transitions. [2019-10-02 12:02:32,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 12:02:32,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 388 [2019-10-02 12:02:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:34,334 INFO L225 Difference]: With dead ends: 471255 [2019-10-02 12:02:34,334 INFO L226 Difference]: Without dead ends: 323568 [2019-10-02 12:02:34,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 12:02:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323568 states. [2019-10-02 12:02:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323568 to 321276. [2019-10-02 12:02:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321276 states. [2019-10-02 12:03:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321276 states to 321276 states and 530147 transitions. [2019-10-02 12:03:01,284 INFO L78 Accepts]: Start accepts. Automaton has 321276 states and 530147 transitions. Word has length 388 [2019-10-02 12:03:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:01,285 INFO L475 AbstractCegarLoop]: Abstraction has 321276 states and 530147 transitions. [2019-10-02 12:03:01,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:03:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 321276 states and 530147 transitions. [2019-10-02 12:03:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-02 12:03:01,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:01,304 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:03:01,304 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash 112427941, now seen corresponding path program 1 times [2019-10-02 12:03:01,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:01,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:01,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-10-02 12:03:01,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:01,582 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:02,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:03,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 4043 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:03:03,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-02 12:03:03,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:03,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 12:03:03,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:03,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:03,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:03,410 INFO L87 Difference]: Start difference. First operand 321276 states and 530147 transitions. Second operand 9 states. [2019-10-02 12:04:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:24,453 INFO L93 Difference]: Finished difference Result 1316072 states and 2308876 transitions. [2019-10-02 12:04:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:04:24,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 392 [2019-10-02 12:04:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:32,617 INFO L225 Difference]: With dead ends: 1316072 [2019-10-02 12:04:32,617 INFO L226 Difference]: Without dead ends: 994903 [2019-10-02 12:04:33,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994903 states. [2019-10-02 12:06:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994903 to 994709. [2019-10-02 12:06:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994709 states.