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_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:10:39,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:10:39,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:10:39,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:10:39,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:10:39,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:10:39,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:10:39,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:10:39,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:10:39,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:10:39,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:10:39,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:10:39,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:10:39,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:10:39,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:10:39,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:10:39,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:10:39,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:10:39,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:10:39,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:10:39,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:10:39,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:10:39,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:10:39,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:10:39,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:10:39,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:10:39,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:10:39,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:10:39,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:10:39,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:10:39,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:10:39,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:10:39,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:10:39,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:10:39,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:10:39,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:10:39,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:10:39,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:10:39,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:10:39,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:10:39,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:10:39,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:10:39,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:10:39,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:10:39,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:10:39,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:10:39,567 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:10:39,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:10:39,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:10:39,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:10:39,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:10:39,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:10:39,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:10:39,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:10:39,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:10:39,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:10:39,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:10:39,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:10:39,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:10:39,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:10:39,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:10:39,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:10:39,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:10:39,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:10:39,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:10:39,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:10:39,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:10:39,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:10:39,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:10:39,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:10:39,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:10:39,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:10:39,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:10:39,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:10:39,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:10:39,625 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:10:39,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product30.cil.c [2019-10-02 12:10:39,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ba11758/87f0d52b9275400ca1707ec5ebd33ab9/FLAG5bd709668 [2019-10-02 12:10:40,379 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:10:40,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product30.cil.c [2019-10-02 12:10:40,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ba11758/87f0d52b9275400ca1707ec5ebd33ab9/FLAG5bd709668 [2019-10-02 12:10:40,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ba11758/87f0d52b9275400ca1707ec5ebd33ab9 [2019-10-02 12:10:40,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:10:40,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:10:40,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:10:40,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:10:40,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:10:40,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:10:40" (1/1) ... [2019-10-02 12:10:40,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba36926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:40, skipping insertion in model container [2019-10-02 12:10:40,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:10:40" (1/1) ... [2019-10-02 12:10:40,570 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:10:40,658 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:10:41,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:10:41,447 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:10:41,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:10:41,730 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:10:41,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41 WrapperNode [2019-10-02 12:10:41,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:10:41,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:10:41,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:10:41,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:10:41,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (1/1) ... [2019-10-02 12:10:41,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (1/1) ... [2019-10-02 12:10:41,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (1/1) ... [2019-10-02 12:10:41,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (1/1) ... [2019-10-02 12:10:41,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (1/1) ... [2019-10-02 12:10:41,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (1/1) ... [2019-10-02 12:10:41,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (1/1) ... [2019-10-02 12:10:41,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:10:41,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:10:41,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:10:41,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:10:41,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:10:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:10:42,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:10:42,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:10:42,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:10:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:10:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:10:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:10:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:10:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:10:42,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:10:42,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:10:42,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:10:42,052 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:10:42,052 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:10:42,053 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:10:42,053 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:10:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:10:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:10:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:10:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:10:42,057 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:10:42,057 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:10:42,057 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:10:42,057 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:10:42,057 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:10:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:10:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:10:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:10:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:10:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:10:42,059 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:10:42,059 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:10:42,059 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:10:42,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:10:42,059 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:10:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:10:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:10:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:10:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:10:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:10:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:10:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:10:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:10:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:10:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:10:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:10:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:10:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:10:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:10:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:10:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:10:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:10:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:10:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:10:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:10:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:10:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:10:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:10:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:10:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:10:42,065 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:10:42,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:10:42,065 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:10:42,065 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:10:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:10:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:10:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:10:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:10:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:10:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:10:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-02 12:10:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:10:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-02 12:10:42,068 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:10:42,068 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:10:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:10:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:10:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:10:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:10:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:10:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:10:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:10:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:10:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:10:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:10:42,071 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:10:42,071 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:10:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:10:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:10:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:10:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:10:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:10:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:10:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:10:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:10:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:10:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:10:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:10:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:10:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:10:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:10:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:10:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:10:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:10:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:10:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:10:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:10:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:10:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:10:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:10:42,075 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:10:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:10:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:10:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:10:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:10:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:10:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:10:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:10:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:10:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:10:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:10:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:10:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:10:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:10:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:10:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:10:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:10:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:10:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:10:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:10:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:10:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:10:42,080 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:10:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:10:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:10:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:10:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:10:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:10:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:10:42,082 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:10:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:10:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:10:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:10:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:10:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:10:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:10:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:10:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:10:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:10:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:10:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:10:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:10:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:10:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:10:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:10:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:10:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:10:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:10:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:10:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:10:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:10:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:10:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:10:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:10:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:10:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:10:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-02 12:10:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:10:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-02 12:10:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:10:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:10:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:10:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:10:44,451 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:10:44,451 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:10:44,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:10:44 BoogieIcfgContainer [2019-10-02 12:10:44,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:10:44,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:10:44,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:10:44,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:10:44,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:10:40" (1/3) ... [2019-10-02 12:10:44,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ba54bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:10:44, skipping insertion in model container [2019-10-02 12:10:44,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:41" (2/3) ... [2019-10-02 12:10:44,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ba54bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:10:44, skipping insertion in model container [2019-10-02 12:10:44,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:10:44" (3/3) ... [2019-10-02 12:10:44,462 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product30.cil.c [2019-10-02 12:10:44,473 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:10:44,485 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:10:44,503 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:10:44,550 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:10:44,551 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:10:44,551 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:10:44,551 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:10:44,551 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:10:44,551 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:10:44,551 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:10:44,551 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:10:44,552 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:10:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states. [2019-10-02 12:10:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:10:44,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:44,627 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:44,630 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2022384104, now seen corresponding path program 1 times [2019-10-02 12:10:44,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:44,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:44,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:10:45,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:45,221 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:45,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:45,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:10:45,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:10:45,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:45,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:10:45,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:10:46,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:10:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:10:46,013 INFO L87 Difference]: Start difference. First operand 806 states. Second operand 4 states. [2019-10-02 12:10:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:46,251 INFO L93 Difference]: Finished difference Result 1282 states and 2063 transitions. [2019-10-02 12:10:46,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:10:46,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 12:10:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:46,290 INFO L225 Difference]: With dead ends: 1282 [2019-10-02 12:10:46,290 INFO L226 Difference]: Without dead ends: 645 [2019-10-02 12:10:46,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 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:10:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-02 12:10:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2019-10-02 12:10:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-02 12:10:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1025 transitions. [2019-10-02 12:10:46,453 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1025 transitions. Word has length 116 [2019-10-02 12:10:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:46,454 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 1025 transitions. [2019-10-02 12:10:46,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:10:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1025 transitions. [2019-10-02 12:10:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:10:46,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:46,462 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:46,466 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2025770863, now seen corresponding path program 1 times [2019-10-02 12:10:46,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:46,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:46,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:46,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:46,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:10:46,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:46,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:46,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:47,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:47,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 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 12:10:47,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:47,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:47,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:47,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:47,463 INFO L87 Difference]: Start difference. First operand 645 states and 1025 transitions. Second operand 6 states. [2019-10-02 12:10:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:47,623 INFO L93 Difference]: Finished difference Result 1262 states and 2023 transitions. [2019-10-02 12:10:47,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:10:47,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-02 12:10:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:47,631 INFO L225 Difference]: With dead ends: 1262 [2019-10-02 12:10:47,631 INFO L226 Difference]: Without dead ends: 645 [2019-10-02 12:10:47,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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 12:10:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-02 12:10:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2019-10-02 12:10:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-02 12:10:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1024 transitions. [2019-10-02 12:10:47,687 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1024 transitions. Word has length 120 [2019-10-02 12:10:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:47,688 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 1024 transitions. [2019-10-02 12:10:47,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1024 transitions. [2019-10-02 12:10:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:10:47,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:47,692 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:47,692 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1223604915, now seen corresponding path program 1 times [2019-10-02 12:10:47,696 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:47,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:10:47,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:47,852 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:47,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:48,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 3177 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:48,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:10:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:48,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:48,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:48,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:48,468 INFO L87 Difference]: Start difference. First operand 645 states and 1024 transitions. Second operand 6 states. [2019-10-02 12:10:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:48,621 INFO L93 Difference]: Finished difference Result 1266 states and 2026 transitions. [2019-10-02 12:10:48,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:10:48,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-02 12:10:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:48,629 INFO L225 Difference]: With dead ends: 1266 [2019-10-02 12:10:48,630 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:10:48,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 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 12:10:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:10:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:10:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:10:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1029 transitions. [2019-10-02 12:10:48,695 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1029 transitions. Word has length 122 [2019-10-02 12:10:48,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:48,696 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1029 transitions. [2019-10-02 12:10:48,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:48,696 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1029 transitions. [2019-10-02 12:10:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:10:48,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:48,699 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:48,700 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1957225257, now seen corresponding path program 1 times [2019-10-02 12:10:48,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:48,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:48,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:10:48,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:48,896 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:49,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:49,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:49,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:10:49,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:49,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:49,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:49,488 INFO L87 Difference]: Start difference. First operand 651 states and 1029 transitions. Second operand 6 states. [2019-10-02 12:10:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:49,590 INFO L93 Difference]: Finished difference Result 1265 states and 2017 transitions. [2019-10-02 12:10:49,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:10:49,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 12:10:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:49,599 INFO L225 Difference]: With dead ends: 1265 [2019-10-02 12:10:49,600 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:10:49,605 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 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 12:10:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:10:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:10:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:10:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1028 transitions. [2019-10-02 12:10:49,639 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1028 transitions. Word has length 123 [2019-10-02 12:10:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:49,640 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1028 transitions. [2019-10-02 12:10:49,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1028 transitions. [2019-10-02 12:10:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:10:49,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:49,650 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:49,650 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash 974787383, now seen corresponding path program 1 times [2019-10-02 12:10:49,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:49,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:49,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:49,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:10:49,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:49,826 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:49,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:50,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:50,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:10:50,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:50,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:50,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:50,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:50,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:50,451 INFO L87 Difference]: Start difference. First operand 651 states and 1028 transitions. Second operand 6 states. [2019-10-02 12:10:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:50,533 INFO L93 Difference]: Finished difference Result 1265 states and 2016 transitions. [2019-10-02 12:10:50,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:10:50,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-10-02 12:10:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:50,540 INFO L225 Difference]: With dead ends: 1265 [2019-10-02 12:10:50,540 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:10:50,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 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 12:10:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:10:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:10:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:10:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1027 transitions. [2019-10-02 12:10:50,576 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1027 transitions. Word has length 124 [2019-10-02 12:10:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:50,577 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1027 transitions. [2019-10-02 12:10:50,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1027 transitions. [2019-10-02 12:10:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:10:50,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:50,580 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:50,581 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:50,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash 131398875, now seen corresponding path program 1 times [2019-10-02 12:10:50,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:50,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:50,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:50,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:50,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:10:50,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:50,828 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:50,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:51,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:51,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:10:51,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:51,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 12:10:51,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:10:51,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:10:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:10:51,653 INFO L87 Difference]: Start difference. First operand 651 states and 1027 transitions. Second operand 12 states. [2019-10-02 12:10:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:52,206 INFO L93 Difference]: Finished difference Result 1276 states and 2036 transitions. [2019-10-02 12:10:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:10:52,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2019-10-02 12:10:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:52,213 INFO L225 Difference]: With dead ends: 1276 [2019-10-02 12:10:52,213 INFO L226 Difference]: Without dead ends: 660 [2019-10-02 12:10:52,218 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 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 12:10:52,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-02 12:10:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 658. [2019-10-02 12:10:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 12:10:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1032 transitions. [2019-10-02 12:10:52,248 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1032 transitions. Word has length 125 [2019-10-02 12:10:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:52,249 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 1032 transitions. [2019-10-02 12:10:52,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:10:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1032 transitions. [2019-10-02 12:10:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:10:52,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:52,253 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:52,253 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:52,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1601016890, now seen corresponding path program 1 times [2019-10-02 12:10:52,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:52,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:52,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:10:52,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:52,413 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:53,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:53,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:10:53,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:53,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:10:53,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:10:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:10:53,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:53,126 INFO L87 Difference]: Start difference. First operand 658 states and 1032 transitions. Second operand 8 states. [2019-10-02 12:10:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:53,415 INFO L93 Difference]: Finished difference Result 1277 states and 2026 transitions. [2019-10-02 12:10:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:10:53,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-10-02 12:10:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:53,423 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:10:53,423 INFO L226 Difference]: Without dead ends: 658 [2019-10-02 12:10:53,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 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 12:10:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-02 12:10:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-10-02 12:10:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 12:10:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1027 transitions. [2019-10-02 12:10:53,460 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1027 transitions. Word has length 128 [2019-10-02 12:10:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:53,460 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 1027 transitions. [2019-10-02 12:10:53,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:10:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1027 transitions. [2019-10-02 12:10:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:10:53,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:53,465 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:53,465 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:53,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1211852194, now seen corresponding path program 1 times [2019-10-02 12:10:53,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:53,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:53,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:53,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:53,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:10:53,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:53,655 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 12:10:53,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:54,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:54,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:10:54,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:54,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:10:54,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:10:54,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:10:54,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:54,374 INFO L87 Difference]: Start difference. First operand 658 states and 1027 transitions. Second operand 8 states. [2019-10-02 12:10:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:54,695 INFO L93 Difference]: Finished difference Result 1298 states and 2047 transitions. [2019-10-02 12:10:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:10:54,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-10-02 12:10:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:54,706 INFO L225 Difference]: With dead ends: 1298 [2019-10-02 12:10:54,706 INFO L226 Difference]: Without dead ends: 685 [2019-10-02 12:10:54,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 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 12:10:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-02 12:10:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2019-10-02 12:10:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 12:10:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1054 transitions. [2019-10-02 12:10:54,746 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1054 transitions. Word has length 130 [2019-10-02 12:10:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:54,747 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1054 transitions. [2019-10-02 12:10:54,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:10:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1054 transitions. [2019-10-02 12:10:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:10:54,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:54,750 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:54,750 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash 190251774, now seen corresponding path program 1 times [2019-10-02 12:10:54,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:54,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:54,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:54,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:54,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:10:54,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:54,899 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 12:10:55,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:55,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:55,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:10:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:55,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:55,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:55,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:55,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:55,492 INFO L87 Difference]: Start difference. First operand 682 states and 1054 transitions. Second operand 6 states. [2019-10-02 12:10:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:55,761 INFO L93 Difference]: Finished difference Result 1325 states and 2066 transitions. [2019-10-02 12:10:55,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:10:55,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-02 12:10:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:55,768 INFO L225 Difference]: With dead ends: 1325 [2019-10-02 12:10:55,768 INFO L226 Difference]: Without dead ends: 669 [2019-10-02 12:10:55,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-10-02 12:10:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2019-10-02 12:10:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-02 12:10:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1029 transitions. [2019-10-02 12:10:55,804 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1029 transitions. Word has length 130 [2019-10-02 12:10:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:55,805 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 1029 transitions. [2019-10-02 12:10:55,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1029 transitions. [2019-10-02 12:10:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:10:55,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:55,807 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:55,807 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:55,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1612034594, now seen corresponding path program 1 times [2019-10-02 12:10:55,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:55,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:55,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:10:55,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:55,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 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 12:10:56,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:56,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:10:56,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:10:56,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:56,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:10:56,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:10:56,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:10:56,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:10:56,714 INFO L87 Difference]: Start difference. First operand 669 states and 1029 transitions. Second operand 14 states. [2019-10-02 12:10:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:57,046 INFO L93 Difference]: Finished difference Result 1284 states and 1999 transitions. [2019-10-02 12:10:57,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:10:57,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-10-02 12:10:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:57,054 INFO L225 Difference]: With dead ends: 1284 [2019-10-02 12:10:57,054 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 12:10:57,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 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 12:10:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 12:10:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 658. [2019-10-02 12:10:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 12:10:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1012 transitions. [2019-10-02 12:10:57,085 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1012 transitions. Word has length 130 [2019-10-02 12:10:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:57,085 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 1012 transitions. [2019-10-02 12:10:57,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:10:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1012 transitions. [2019-10-02 12:10:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:10:57,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:57,089 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:57,089 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:57,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash -625920274, now seen corresponding path program 1 times [2019-10-02 12:10:57,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:57,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:57,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:57,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:57,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:10:57,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:57,285 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 12:10:57,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:58,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:58,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:10:58,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:58,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:10:58,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:10:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:10:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:58,090 INFO L87 Difference]: Start difference. First operand 658 states and 1012 transitions. Second operand 8 states. [2019-10-02 12:10:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:58,290 INFO L93 Difference]: Finished difference Result 1266 states and 1971 transitions. [2019-10-02 12:10:58,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:10:58,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-10-02 12:10:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:58,297 INFO L225 Difference]: With dead ends: 1266 [2019-10-02 12:10:58,298 INFO L226 Difference]: Without dead ends: 658 [2019-10-02 12:10:58,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 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 12:10:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-02 12:10:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-10-02 12:10:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 12:10:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1011 transitions. [2019-10-02 12:10:58,336 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1011 transitions. Word has length 134 [2019-10-02 12:10:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:58,337 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 1011 transitions. [2019-10-02 12:10:58,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:10:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1011 transitions. [2019-10-02 12:10:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:10:58,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:58,341 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:58,341 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1395430142, now seen corresponding path program 1 times [2019-10-02 12:10:58,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:58,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:58,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:58,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:58,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:10:58,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:58,647 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 12:10:58,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:59,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 3190 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:10:59,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:10:59,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:59,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:10:59,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:10:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:10:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:10:59,290 INFO L87 Difference]: Start difference. First operand 658 states and 1011 transitions. Second operand 18 states. [2019-10-02 12:10:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:59,874 INFO L93 Difference]: Finished difference Result 1282 states and 1998 transitions. [2019-10-02 12:10:59,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:10:59,874 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2019-10-02 12:10:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:59,880 INFO L225 Difference]: With dead ends: 1282 [2019-10-02 12:10:59,880 INFO L226 Difference]: Without dead ends: 673 [2019-10-02 12:10:59,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 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 12:10:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-10-02 12:10:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 669. [2019-10-02 12:10:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-10-02 12:10:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1019 transitions. [2019-10-02 12:10:59,908 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1019 transitions. Word has length 135 [2019-10-02 12:10:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:59,908 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 1019 transitions. [2019-10-02 12:10:59,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:10:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1019 transitions. [2019-10-02 12:10:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:10:59,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:59,911 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:10:59,911 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -105597136, now seen corresponding path program 1 times [2019-10-02 12:10:59,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:59,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:59,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:11:00,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:00,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:11:00,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:11:00,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:11:00,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:11:00,064 INFO L87 Difference]: Start difference. First operand 669 states and 1019 transitions. Second operand 9 states. [2019-10-02 12:11:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:00,227 INFO L93 Difference]: Finished difference Result 1213 states and 1894 transitions. [2019-10-02 12:11:00,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:00,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-02 12:11:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:00,232 INFO L225 Difference]: With dead ends: 1213 [2019-10-02 12:11:00,233 INFO L226 Difference]: Without dead ends: 666 [2019-10-02 12:11:00,236 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 12:11:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-02 12:11:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-10-02 12:11:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-10-02 12:11:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1014 transitions. [2019-10-02 12:11:00,259 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1014 transitions. Word has length 136 [2019-10-02 12:11:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:00,259 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1014 transitions. [2019-10-02 12:11:00,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:11:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1014 transitions. [2019-10-02 12:11:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:11:00,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:00,262 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:00,262 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:00,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash 232053260, now seen corresponding path program 1 times [2019-10-02 12:11:00,262 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:00,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:00,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:11:00,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:00,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:11:00,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:11:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:11:00,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:11:00,394 INFO L87 Difference]: Start difference. First operand 666 states and 1014 transitions. Second operand 7 states. [2019-10-02 12:11:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:00,497 INFO L93 Difference]: Finished difference Result 1210 states and 1889 transitions. [2019-10-02 12:11:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:11:00,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-10-02 12:11:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:00,503 INFO L225 Difference]: With dead ends: 1210 [2019-10-02 12:11:00,503 INFO L226 Difference]: Without dead ends: 645 [2019-10-02 12:11:00,507 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 12:11:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-02 12:11:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 643. [2019-10-02 12:11:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-02 12:11:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 984 transitions. [2019-10-02 12:11:00,529 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 984 transitions. Word has length 137 [2019-10-02 12:11:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:00,530 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 984 transitions. [2019-10-02 12:11:00,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:11:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 984 transitions. [2019-10-02 12:11:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:11:00,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:00,532 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:00,533 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:00,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1292398391, now seen corresponding path program 1 times [2019-10-02 12:11:00,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:00,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:00,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:00,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:11:00,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:00,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:11:00,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:11:00,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:11:00,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:11:00,755 INFO L87 Difference]: Start difference. First operand 643 states and 984 transitions. Second operand 13 states. [2019-10-02 12:11:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:01,101 INFO L93 Difference]: Finished difference Result 1253 states and 1945 transitions. [2019-10-02 12:11:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:11:01,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-10-02 12:11:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:01,109 INFO L225 Difference]: With dead ends: 1253 [2019-10-02 12:11:01,109 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:11:01,113 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 12:11:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:11:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-10-02 12:11:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-02 12:11:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 999 transitions. [2019-10-02 12:11:01,136 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 999 transitions. Word has length 138 [2019-10-02 12:11:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:01,137 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 999 transitions. [2019-10-02 12:11:01,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:11:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 999 transitions. [2019-10-02 12:11:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:11:01,139 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:01,139 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:01,140 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:01,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:01,140 INFO L82 PathProgramCache]: Analyzing trace with hash 770082899, now seen corresponding path program 1 times [2019-10-02 12:11:01,140 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:01,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:01,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:11:01,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:01,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:11:01,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:11:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:11:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:11:01,346 INFO L87 Difference]: Start difference. First operand 655 states and 999 transitions. Second operand 13 states. [2019-10-02 12:11:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:01,683 INFO L93 Difference]: Finished difference Result 1200 states and 1872 transitions. [2019-10-02 12:11:01,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:11:01,684 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2019-10-02 12:11:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:01,689 INFO L225 Difference]: With dead ends: 1200 [2019-10-02 12:11:01,689 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:11:01,692 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 12:11:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:11:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:11:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:11:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 990 transitions. [2019-10-02 12:11:01,714 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 990 transitions. Word has length 137 [2019-10-02 12:11:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:01,715 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 990 transitions. [2019-10-02 12:11:01,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:11:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 990 transitions. [2019-10-02 12:11:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:11:01,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:01,718 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:01,718 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:01,719 INFO L82 PathProgramCache]: Analyzing trace with hash -843605736, now seen corresponding path program 1 times [2019-10-02 12:11:01,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:01,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:01,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:11:01,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:01,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:11:01,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:11:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:11:01,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:11:01,943 INFO L87 Difference]: Start difference. First operand 648 states and 990 transitions. Second operand 11 states. [2019-10-02 12:11:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:02,301 INFO L93 Difference]: Finished difference Result 1193 states and 1863 transitions. [2019-10-02 12:11:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:11:02,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-10-02 12:11:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:02,315 INFO L225 Difference]: With dead ends: 1193 [2019-10-02 12:11:02,315 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:11:02,321 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 12:11:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:11:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:11:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:11:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 989 transitions. [2019-10-02 12:11:02,352 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 989 transitions. Word has length 139 [2019-10-02 12:11:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:02,356 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 989 transitions. [2019-10-02 12:11:02,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:11:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 989 transitions. [2019-10-02 12:11:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:11:02,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:02,360 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:02,360 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash -983276174, now seen corresponding path program 1 times [2019-10-02 12:11:02,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:02,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:02,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:11:02,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:02,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:11:02,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:11:02,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:11:02,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:11:02,556 INFO L87 Difference]: Start difference. First operand 648 states and 989 transitions. Second operand 11 states. [2019-10-02 12:11:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:02,790 INFO L93 Difference]: Finished difference Result 1239 states and 1916 transitions. [2019-10-02 12:11:02,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:11:02,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-10-02 12:11:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:02,799 INFO L225 Difference]: With dead ends: 1239 [2019-10-02 12:11:02,800 INFO L226 Difference]: Without dead ends: 645 [2019-10-02 12:11:02,803 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 12:11:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-02 12:11:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2019-10-02 12:11:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-02 12:11:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 981 transitions. [2019-10-02 12:11:02,823 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 981 transitions. Word has length 140 [2019-10-02 12:11:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:02,824 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 981 transitions. [2019-10-02 12:11:02,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:11:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 981 transitions. [2019-10-02 12:11:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:11:02,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:02,826 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:02,826 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:02,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1655105651, now seen corresponding path program 1 times [2019-10-02 12:11:02,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:02,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:02,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:11:03,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:03,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:11:03,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:11:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:11:03,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:11:03,062 INFO L87 Difference]: Start difference. First operand 645 states and 981 transitions. Second operand 6 states. [2019-10-02 12:11:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:06,890 INFO L93 Difference]: Finished difference Result 1813 states and 2881 transitions. [2019-10-02 12:11:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:11:06,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 12:11:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:06,902 INFO L225 Difference]: With dead ends: 1813 [2019-10-02 12:11:06,902 INFO L226 Difference]: Without dead ends: 1277 [2019-10-02 12:11:06,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:11:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-10-02 12:11:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1159. [2019-10-02 12:11:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-10-02 12:11:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1827 transitions. [2019-10-02 12:11:06,976 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1827 transitions. Word has length 141 [2019-10-02 12:11:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:06,978 INFO L475 AbstractCegarLoop]: Abstraction has 1159 states and 1827 transitions. [2019-10-02 12:11:06,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1827 transitions. [2019-10-02 12:11:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:11:06,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:06,989 INFO L411 BasicCegarLoop]: trace histogram [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 12:11:06,989 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:06,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2062662243, now seen corresponding path program 1 times [2019-10-02 12:11:06,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:06,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:06,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:06,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:07,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:07,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:11:07,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:11:07,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:11:07,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:11:07,284 INFO L87 Difference]: Start difference. First operand 1159 states and 1827 transitions. Second operand 12 states. [2019-10-02 12:11:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:18,528 INFO L93 Difference]: Finished difference Result 3657 states and 5842 transitions. [2019-10-02 12:11:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:11:18,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 190 [2019-10-02 12:11:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:18,548 INFO L225 Difference]: With dead ends: 3657 [2019-10-02 12:11:18,548 INFO L226 Difference]: Without dead ends: 2607 [2019-10-02 12:11:18,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:11:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2019-10-02 12:11:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2549. [2019-10-02 12:11:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2019-10-02 12:11:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4026 transitions. [2019-10-02 12:11:18,693 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 4026 transitions. Word has length 190 [2019-10-02 12:11:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:18,693 INFO L475 AbstractCegarLoop]: Abstraction has 2549 states and 4026 transitions. [2019-10-02 12:11:18,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:11:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 4026 transitions. [2019-10-02 12:11:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:11:18,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:18,700 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:18,700 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1008338319, now seen corresponding path program 1 times [2019-10-02 12:11:18,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:18,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:18,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:18,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:18,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:18,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:18,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:11:18,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:11:18,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:11:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:11:18,906 INFO L87 Difference]: Start difference. First operand 2549 states and 4026 transitions. Second operand 6 states. [2019-10-02 12:11:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:24,096 INFO L93 Difference]: Finished difference Result 6575 states and 10659 transitions. [2019-10-02 12:11:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:24,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2019-10-02 12:11:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:24,139 INFO L225 Difference]: With dead ends: 6575 [2019-10-02 12:11:24,139 INFO L226 Difference]: Without dead ends: 4137 [2019-10-02 12:11:24,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:11:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2019-10-02 12:11:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 3901. [2019-10-02 12:11:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2019-10-02 12:11:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 6192 transitions. [2019-10-02 12:11:24,526 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 6192 transitions. Word has length 191 [2019-10-02 12:11:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:24,526 INFO L475 AbstractCegarLoop]: Abstraction has 3901 states and 6192 transitions. [2019-10-02 12:11:24,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6192 transitions. [2019-10-02 12:11:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:11:24,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:24,537 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:24,537 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:24,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1811943119, now seen corresponding path program 1 times [2019-10-02 12:11:24,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:24,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:24,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:24,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:24,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:11:24,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:11:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:11:24,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:11:24,782 INFO L87 Difference]: Start difference. First operand 3901 states and 6192 transitions. Second operand 6 states. [2019-10-02 12:11:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:29,529 INFO L93 Difference]: Finished difference Result 11021 states and 17971 transitions. [2019-10-02 12:11:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:29,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2019-10-02 12:11:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:29,584 INFO L225 Difference]: With dead ends: 11021 [2019-10-02 12:11:29,584 INFO L226 Difference]: Without dead ends: 7232 [2019-10-02 12:11:29,607 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:11:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2019-10-02 12:11:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 6812. [2019-10-02 12:11:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2019-10-02 12:11:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 10909 transitions. [2019-10-02 12:11:30,040 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 10909 transitions. Word has length 192 [2019-10-02 12:11:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:30,040 INFO L475 AbstractCegarLoop]: Abstraction has 6812 states and 10909 transitions. [2019-10-02 12:11:30,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 10909 transitions. [2019-10-02 12:11:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:11:30,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:30,048 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:30,048 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -65844171, now seen corresponding path program 1 times [2019-10-02 12:11:30,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:30,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:30,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:30,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:30,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:30,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:30,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:11:30,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:11:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:11:30,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:11:30,248 INFO L87 Difference]: Start difference. First operand 6812 states and 10909 transitions. Second operand 6 states. [2019-10-02 12:11:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:35,428 INFO L93 Difference]: Finished difference Result 20980 states and 34644 transitions. [2019-10-02 12:11:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:35,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-10-02 12:11:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:35,500 INFO L225 Difference]: With dead ends: 20980 [2019-10-02 12:11:35,500 INFO L226 Difference]: Without dead ends: 14282 [2019-10-02 12:11:35,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:11:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14282 states. [2019-10-02 12:11:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14282 to 13313. [2019-10-02 12:11:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13313 states. [2019-10-02 12:11:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13313 states to 13313 states and 21642 transitions. [2019-10-02 12:11:36,265 INFO L78 Accepts]: Start accepts. Automaton has 13313 states and 21642 transitions. Word has length 193 [2019-10-02 12:11:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:36,265 INFO L475 AbstractCegarLoop]: Abstraction has 13313 states and 21642 transitions. [2019-10-02 12:11:36,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 13313 states and 21642 transitions. [2019-10-02 12:11:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:11:36,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:36,277 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:36,277 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:36,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:36,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1554873965, now seen corresponding path program 1 times [2019-10-02 12:11:36,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:36,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:36,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:36,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:36,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:36,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:36,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:11:36,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:11:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:11:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:11:36,462 INFO L87 Difference]: Start difference. First operand 13313 states and 21642 transitions. Second operand 6 states. [2019-10-02 12:11:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:41,589 INFO L93 Difference]: Finished difference Result 44553 states and 75229 transitions. [2019-10-02 12:11:41,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:41,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-10-02 12:11:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:41,823 INFO L225 Difference]: With dead ends: 44553 [2019-10-02 12:11:41,823 INFO L226 Difference]: Without dead ends: 31358 [2019-10-02 12:11:41,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:11:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31358 states. [2019-10-02 12:11:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31358 to 28698. [2019-10-02 12:11:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28698 states. [2019-10-02 12:11:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28698 states to 28698 states and 47849 transitions. [2019-10-02 12:11:44,156 INFO L78 Accepts]: Start accepts. Automaton has 28698 states and 47849 transitions. Word has length 194 [2019-10-02 12:11:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:44,156 INFO L475 AbstractCegarLoop]: Abstraction has 28698 states and 47849 transitions. [2019-10-02 12:11:44,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 28698 states and 47849 transitions. [2019-10-02 12:11:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:11:44,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:44,163 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:44,164 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1507889286, now seen corresponding path program 1 times [2019-10-02 12:11:44,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:44,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:44,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:44,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:44,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:44,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:44,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:11:44,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:11:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:11:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:11:44,366 INFO L87 Difference]: Start difference. First operand 28698 states and 47849 transitions. Second operand 9 states. [2019-10-02 12:11:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:53,271 INFO L93 Difference]: Finished difference Result 95419 states and 160774 transitions. [2019-10-02 12:11:53,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:11:53,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-10-02 12:11:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:53,672 INFO L225 Difference]: With dead ends: 95419 [2019-10-02 12:11:53,672 INFO L226 Difference]: Without dead ends: 66847 [2019-10-02 12:11:53,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 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:11:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66847 states. [2019-10-02 12:11:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66847 to 65572. [2019-10-02 12:11:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65572 states. [2019-10-02 12:11:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65572 states to 65572 states and 108952 transitions. [2019-10-02 12:11:57,359 INFO L78 Accepts]: Start accepts. Automaton has 65572 states and 108952 transitions. Word has length 195 [2019-10-02 12:11:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:57,360 INFO L475 AbstractCegarLoop]: Abstraction has 65572 states and 108952 transitions. [2019-10-02 12:11:57,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:11:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 65572 states and 108952 transitions. [2019-10-02 12:11:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 12:11:57,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:57,371 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:11:57,371 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1695689514, now seen corresponding path program 1 times [2019-10-02 12:11:57,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:57,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:57,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:57,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:59,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:59,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:11:59,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:11:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:11:59,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:11:59,457 INFO L87 Difference]: Start difference. First operand 65572 states and 108952 transitions. Second operand 7 states. [2019-10-02 12:12:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:02,193 INFO L93 Difference]: Finished difference Result 133007 states and 221544 transitions. [2019-10-02 12:12:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:12:02,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-10-02 12:12:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:02,605 INFO L225 Difference]: With dead ends: 133007 [2019-10-02 12:12:02,606 INFO L226 Difference]: Without dead ends: 67561 [2019-10-02 12:12:02,805 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:12:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67561 states. [2019-10-02 12:12:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67561 to 66643. [2019-10-02 12:12:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66643 states. [2019-10-02 12:12:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66643 states to 66643 states and 110482 transitions. [2019-10-02 12:12:05,883 INFO L78 Accepts]: Start accepts. Automaton has 66643 states and 110482 transitions. Word has length 200 [2019-10-02 12:12:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:05,884 INFO L475 AbstractCegarLoop]: Abstraction has 66643 states and 110482 transitions. [2019-10-02 12:12:05,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:12:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 66643 states and 110482 transitions. [2019-10-02 12:12:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:12:05,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:05,892 INFO L411 BasicCegarLoop]: trace histogram [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:12:05,892 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1868223164, now seen corresponding path program 1 times [2019-10-02 12:12:05,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:05,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:05,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:12:06,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:12:06,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:12:06,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:12:06,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:12:06,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:12:06,035 INFO L87 Difference]: Start difference. First operand 66643 states and 110482 transitions. Second operand 7 states. [2019-10-02 12:12:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:08,810 INFO L93 Difference]: Finished difference Result 134843 states and 223992 transitions. [2019-10-02 12:12:08,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:12:08,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-10-02 12:12:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:09,160 INFO L225 Difference]: With dead ends: 134843 [2019-10-02 12:12:09,161 INFO L226 Difference]: Without dead ends: 68326 [2019-10-02 12:12:09,378 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:12:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68326 states. [2019-10-02 12:12:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68326 to 66796. [2019-10-02 12:12:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66796 states. [2019-10-02 12:12:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66796 states to 66796 states and 110635 transitions. [2019-10-02 12:12:15,406 INFO L78 Accepts]: Start accepts. Automaton has 66796 states and 110635 transitions. Word has length 201 [2019-10-02 12:12:15,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:15,406 INFO L475 AbstractCegarLoop]: Abstraction has 66796 states and 110635 transitions. [2019-10-02 12:12:15,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:12:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 66796 states and 110635 transitions. [2019-10-02 12:12:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:12:15,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:15,416 INFO L411 BasicCegarLoop]: trace histogram [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:12:15,417 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:15,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1193988486, now seen corresponding path program 1 times [2019-10-02 12:12:15,417 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:15,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:15,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:15,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:15,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:12:15,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:12:15,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:12:15,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:12:15,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:12:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:12:15,568 INFO L87 Difference]: Start difference. First operand 66796 states and 110635 transitions. Second operand 5 states. [2019-10-02 12:12:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:18,275 INFO L93 Difference]: Finished difference Result 134438 states and 222629 transitions. [2019-10-02 12:12:18,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:12:18,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-10-02 12:12:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:18,634 INFO L225 Difference]: With dead ends: 134438 [2019-10-02 12:12:18,634 INFO L226 Difference]: Without dead ends: 67768 [2019-10-02 12:12:18,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:12:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67768 states. [2019-10-02 12:12:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67768 to 66886. [2019-10-02 12:12:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66886 states. [2019-10-02 12:12:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66886 states to 66886 states and 110743 transitions. [2019-10-02 12:12:24,867 INFO L78 Accepts]: Start accepts. Automaton has 66886 states and 110743 transitions. Word has length 201 [2019-10-02 12:12:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:24,867 INFO L475 AbstractCegarLoop]: Abstraction has 66886 states and 110743 transitions. [2019-10-02 12:12:24,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:12:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 66886 states and 110743 transitions. [2019-10-02 12:12:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:12:24,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:24,876 INFO L411 BasicCegarLoop]: trace histogram [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:12:24,876 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash 913638597, now seen corresponding path program 1 times [2019-10-02 12:12:24,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:24,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:24,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:12:25,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:12:25,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:12:25,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:12:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:12:25,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:12:25,059 INFO L87 Difference]: Start difference. First operand 66886 states and 110743 transitions. Second operand 6 states. [2019-10-02 12:12:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:37,494 INFO L93 Difference]: Finished difference Result 237374 states and 413577 transitions. [2019-10-02 12:12:37,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:12:37,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-10-02 12:12:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:38,475 INFO L225 Difference]: With dead ends: 237374 [2019-10-02 12:12:38,475 INFO L226 Difference]: Without dead ends: 170614 [2019-10-02 12:12:39,328 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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:12:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170614 states. [2019-10-02 12:12:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170614 to 154619. [2019-10-02 12:12:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154619 states. [2019-10-02 12:12:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154619 states to 154619 states and 265308 transitions. [2019-10-02 12:12:52,122 INFO L78 Accepts]: Start accepts. Automaton has 154619 states and 265308 transitions. Word has length 201 [2019-10-02 12:12:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:52,122 INFO L475 AbstractCegarLoop]: Abstraction has 154619 states and 265308 transitions. [2019-10-02 12:12:52,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:12:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 154619 states and 265308 transitions. [2019-10-02 12:12:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 12:12:52,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:52,132 INFO L411 BasicCegarLoop]: trace histogram [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:12:52,132 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1733980915, now seen corresponding path program 1 times [2019-10-02 12:12:52,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:52,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:52,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:52,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:12:52,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:12:52,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:12:52,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:12:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:12:52,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:12:52,365 INFO L87 Difference]: Start difference. First operand 154619 states and 265308 transitions. Second operand 8 states. [2019-10-02 12:13:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:16,046 INFO L93 Difference]: Finished difference Result 485571 states and 847882 transitions. [2019-10-02 12:13:16,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:13:16,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 210 [2019-10-02 12:13:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:17,810 INFO L225 Difference]: With dead ends: 485571 [2019-10-02 12:13:17,810 INFO L226 Difference]: Without dead ends: 331094 [2019-10-02 12:13:24,521 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 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:13:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331094 states. [2019-10-02 12:13:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331094 to 330996. [2019-10-02 12:13:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330996 states. [2019-10-02 12:13:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330996 states to 330996 states and 572412 transitions. [2019-10-02 12:13:54,501 INFO L78 Accepts]: Start accepts. Automaton has 330996 states and 572412 transitions. Word has length 210 [2019-10-02 12:13:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:54,502 INFO L475 AbstractCegarLoop]: Abstraction has 330996 states and 572412 transitions. [2019-10-02 12:13:54,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:13:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 330996 states and 572412 transitions. [2019-10-02 12:13:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:13:54,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:54,511 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:13:54,512 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:54,512 INFO L82 PathProgramCache]: Analyzing trace with hash 490969826, now seen corresponding path program 1 times [2019-10-02 12:13:54,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:54,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:54,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:13:54,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:54,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:13:54,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:13:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:13:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:13:54,682 INFO L87 Difference]: Start difference. First operand 330996 states and 572412 transitions. Second operand 7 states. [2019-10-02 12:14:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:23,066 INFO L93 Difference]: Finished difference Result 664622 states and 1169775 transitions. [2019-10-02 12:14:23,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:14:23,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 212 [2019-10-02 12:14:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:34,992 INFO L225 Difference]: With dead ends: 664622 [2019-10-02 12:14:34,992 INFO L226 Difference]: Without dead ends: 333504 [2019-10-02 12:14:37,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:14:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333504 states. [2019-10-02 12:15:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333504 to 333504. [2019-10-02 12:15:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333504 states. [2019-10-02 12:15:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333504 states to 333504 states and 574557 transitions. [2019-10-02 12:15:06,161 INFO L78 Accepts]: Start accepts. Automaton has 333504 states and 574557 transitions. Word has length 212 [2019-10-02 12:15:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:06,162 INFO L475 AbstractCegarLoop]: Abstraction has 333504 states and 574557 transitions. [2019-10-02 12:15:06,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:15:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 333504 states and 574557 transitions. [2019-10-02 12:15:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:15:06,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:06,168 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:15:06,168 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:06,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1885129815, now seen corresponding path program 1 times [2019-10-02 12:15:06,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:06,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:06,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:06,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:15:06,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:06,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:15:06,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:15:06,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:15:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:15:06,347 INFO L87 Difference]: Start difference. First operand 333504 states and 574557 transitions. Second operand 7 states. [2019-10-02 12:15:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:39,126 INFO L93 Difference]: Finished difference Result 653311 states and 1136320 transitions. [2019-10-02 12:15:39,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:15:39,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 213 [2019-10-02 12:15:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:40,997 INFO L225 Difference]: With dead ends: 653311 [2019-10-02 12:15:40,997 INFO L226 Difference]: Without dead ends: 350947 [2019-10-02 12:15:52,674 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:15:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350947 states. [2019-10-02 12:16:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350947 to 345186. [2019-10-02 12:16:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345186 states. [2019-10-02 12:16:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345186 states to 345186 states and 590490 transitions. [2019-10-02 12:16:29,799 INFO L78 Accepts]: Start accepts. Automaton has 345186 states and 590490 transitions. Word has length 213 [2019-10-02 12:16:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:29,800 INFO L475 AbstractCegarLoop]: Abstraction has 345186 states and 590490 transitions. [2019-10-02 12:16:29,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:16:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 345186 states and 590490 transitions. [2019-10-02 12:16:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 12:16:29,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:29,807 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:16:29,807 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 333223521, now seen corresponding path program 1 times [2019-10-02 12:16:29,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:29,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:29,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:16:29,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:29,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:29,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:29,959 INFO L87 Difference]: Start difference. First operand 345186 states and 590490 transitions. Second operand 6 states. [2019-10-02 12:17:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:02,546 INFO L93 Difference]: Finished difference Result 763626 states and 1312650 transitions. [2019-10-02 12:17:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:17:02,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-10-02 12:17:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:06,003 INFO L225 Difference]: With dead ends: 763626 [2019-10-02 12:17:06,003 INFO L226 Difference]: Without dead ends: 449580 [2019-10-02 12:17:07,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:17:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449580 states. [2019-10-02 12:18:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449580 to 424255. [2019-10-02 12:18:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424255 states. [2019-10-02 12:18:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424255 states to 424255 states and 728745 transitions. [2019-10-02 12:18:04,908 INFO L78 Accepts]: Start accepts. Automaton has 424255 states and 728745 transitions. Word has length 217 [2019-10-02 12:18:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:04,909 INFO L475 AbstractCegarLoop]: Abstraction has 424255 states and 728745 transitions. [2019-10-02 12:18:04,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:18:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 424255 states and 728745 transitions. [2019-10-02 12:18:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:18:04,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:04,919 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:18:04,919 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:04,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1592554999, now seen corresponding path program 1 times [2019-10-02 12:18:04,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:04,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:04,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:18:05,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:05,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:18:05,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:18:05,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:18:05,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:18:05,095 INFO L87 Difference]: Start difference. First operand 424255 states and 728745 transitions. Second operand 4 states. [2019-10-02 12:18:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:43,627 INFO L93 Difference]: Finished difference Result 844968 states and 1499276 transitions. [2019-10-02 12:18:43,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:18:43,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-10-02 12:18:43,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:47,551 INFO L225 Difference]: With dead ends: 844968 [2019-10-02 12:18:47,551 INFO L226 Difference]: Without dead ends: 420822 [2019-10-02 12:19:03,517 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:19:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420822 states. [2019-10-02 12:19:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420822 to 420822. [2019-10-02 12:19:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420822 states. [2019-10-02 12:19:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420822 states to 420822 states and 721879 transitions. [2019-10-02 12:19:49,041 INFO L78 Accepts]: Start accepts. Automaton has 420822 states and 721879 transitions. Word has length 218 [2019-10-02 12:19:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:19:49,042 INFO L475 AbstractCegarLoop]: Abstraction has 420822 states and 721879 transitions. [2019-10-02 12:19:49,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:19:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 420822 states and 721879 transitions. [2019-10-02 12:19:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 12:19:49,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:19:49,049 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:19:49,049 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:19:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:19:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2124875995, now seen corresponding path program 1 times [2019-10-02 12:19:49,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:19:49,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:19:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:19:49,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:19:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:19:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:19:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:19:49,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:19:49,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:19:49,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:19:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:19:49,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:19:49,336 INFO L87 Difference]: Start difference. First operand 420822 states and 721879 transitions. Second operand 9 states.