java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:09:07,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:09:07,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:09:07,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:09:07,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:09:07,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:09:07,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:09:07,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:09:07,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:09:07,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:09:07,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:09:07,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:09:07,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:09:07,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:09:07,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:09:07,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:09:07,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:09:07,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:09:07,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:09:07,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:09:07,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:09:07,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:09:07,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:09:07,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:09:07,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:09:07,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:09:07,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:09:07,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:09:07,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:09:07,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:09:07,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:09:07,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:09:07,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:09:07,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:09:07,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:09:07,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:09:07,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:09:07,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:09:07,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:09:07,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:09:07,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:09:07,991 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-09-08 04:09:08,005 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:09:08,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:09:08,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:09:08,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:09:08,008 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:09:08,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:09:08,009 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:09:08,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:09:08,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:09:08,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:09:08,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:09:08,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:09:08,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:09:08,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:09:08,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:09:08,011 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:09:08,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:09:08,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:09:08,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:09:08,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:09:08,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:09:08,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:09:08,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:09:08,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:09:08,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:09:08,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:09:08,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:09:08,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:09:08,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:09:08,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:09:08,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:09:08,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:09:08,067 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:09:08,069 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:09:08,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product32.cil.c [2019-09-08 04:09:08,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f553148/bd92e8e8cdb24f0cbe8d4a60b397d58e/FLAG1f4650cb5 [2019-09-08 04:09:08,905 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:09:08,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product32.cil.c [2019-09-08 04:09:08,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f553148/bd92e8e8cdb24f0cbe8d4a60b397d58e/FLAG1f4650cb5 [2019-09-08 04:09:09,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f553148/bd92e8e8cdb24f0cbe8d4a60b397d58e [2019-09-08 04:09:09,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:09:09,031 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:09:09,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:09:09,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:09:09,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:09:09,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:09:09" (1/1) ... [2019-09-08 04:09:09,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e610fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:09, skipping insertion in model container [2019-09-08 04:09:09,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:09:09" (1/1) ... [2019-09-08 04:09:09,057 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:09:09,159 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:09:09,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:09:09,939 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:09:10,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:09:10,179 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:09:10,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10 WrapperNode [2019-09-08 04:09:10,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:09:10,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:09:10,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:09:10,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:09:10,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (1/1) ... [2019-09-08 04:09:10,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (1/1) ... [2019-09-08 04:09:10,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (1/1) ... [2019-09-08 04:09:10,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (1/1) ... [2019-09-08 04:09:10,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (1/1) ... [2019-09-08 04:09:10,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (1/1) ... [2019-09-08 04:09:10,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (1/1) ... [2019-09-08 04:09:10,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:09:10,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:09:10,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:09:10,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:09:10,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:09:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:09:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:09:10,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:09:10,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:09:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:09:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:09:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:09:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:09:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:09:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:09:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:09:10,536 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:09:10,536 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:09:10,537 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:09:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:09:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:09:10,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:09:10,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:09:10,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:09:10,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:09:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:09:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:09:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:09:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:09:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:09:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:09:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:09:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:09:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:09:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:09:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:09:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:09:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:09:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:09:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:09:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:09:10,544 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:09:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:09:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:09:10,545 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:09:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:09:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:09:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:09:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:09:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:09:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:09:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:09:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:09:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:09:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:09:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:09:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:09:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:09:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:09:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:09:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:09:10,549 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:09:10,549 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:09:10,549 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:09:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:09:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:09:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:09:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:09:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:09:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:09:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:09:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:09:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 04:09:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:09:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:09:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:09:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:09:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 04:09:10,552 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:09:10,553 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:09:10,553 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:09:10,554 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-08 04:09:10,554 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:09:10,554 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-08 04:09:10,554 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:09:10,554 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:09:10,554 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:09:10,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:09:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:09:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:09:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:09:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:09:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:09:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:09:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:09:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:09:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:09:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:09:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:09:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:09:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:09:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:09:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:09:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:09:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:09:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:09:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:09:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:09:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:09:10,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:09:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:09:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:09:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:09:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:09:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:09:10,561 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:09:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:09:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:09:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:09:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:09:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:09:10,562 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:09:10,563 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:09:10,563 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:09:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:09:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:09:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:09:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:09:10,565 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:09:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:09:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:09:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:09:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:09:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:09:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:09:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:09:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:09:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:09:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:09:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:09:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:09:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:09:10,568 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:09:10,569 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:09:10,569 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:09:10,572 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:09:10,573 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:09:10,573 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:09:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:09:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:09:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:09:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:09:10,580 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:09:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:09:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:09:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:09:10,581 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:09:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:09:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:09:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:09:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:09:10,583 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:09:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:09:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:09:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:09:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:09:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:09:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:09:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:09:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:09:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:09:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:09:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 04:09:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:09:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:09:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:09:10,586 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 04:09:10,586 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:09:10,586 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:09:10,586 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:09:10,586 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-08 04:09:10,586 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-08 04:09:10,587 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:09:10,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:09:10,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:09:10,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:09:13,053 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:09:13,053 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:09:13,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:09:13 BoogieIcfgContainer [2019-09-08 04:09:13,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:09:13,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:09:13,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:09:13,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:09:13,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:09:09" (1/3) ... [2019-09-08 04:09:13,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b0b58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:09:13, skipping insertion in model container [2019-09-08 04:09:13,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:09:10" (2/3) ... [2019-09-08 04:09:13,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b0b58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:09:13, skipping insertion in model container [2019-09-08 04:09:13,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:09:13" (3/3) ... [2019-09-08 04:09:13,067 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product32.cil.c [2019-09-08 04:09:13,080 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:09:13,092 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:09:13,110 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:09:13,158 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:09:13,159 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:09:13,159 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:09:13,159 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:09:13,159 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:09:13,159 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:09:13,159 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:09:13,159 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:09:13,160 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:09:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states. [2019-09-08 04:09:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 04:09:13,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:13,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:13,240 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2061998394, now seen corresponding path program 1 times [2019-09-08 04:09:13,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:13,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:13,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:13,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:13,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:13,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:13,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:13,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:13,822 INFO L87 Difference]: Start difference. First operand 833 states. Second operand 4 states. [2019-09-08 04:09:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:14,103 INFO L93 Difference]: Finished difference Result 1315 states and 2101 transitions. [2019-09-08 04:09:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:14,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 04:09:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:14,151 INFO L225 Difference]: With dead ends: 1315 [2019-09-08 04:09:14,152 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 04:09:14,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:09:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 04:09:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-08 04:09:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 04:09:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1052 transitions. [2019-09-08 04:09:14,335 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1052 transitions. Word has length 85 [2019-09-08 04:09:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:14,335 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1052 transitions. [2019-09-08 04:09:14,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1052 transitions. [2019-09-08 04:09:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 04:09:14,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:14,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:14,348 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:14,350 INFO L82 PathProgramCache]: Analyzing trace with hash 190887692, now seen corresponding path program 1 times [2019-09-08 04:09:14,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:14,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:14,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:14,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:14,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:14,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:14,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:14,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:14,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:14,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:14,604 INFO L87 Difference]: Start difference. First operand 666 states and 1052 transitions. Second operand 4 states. [2019-09-08 04:09:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:14,712 INFO L93 Difference]: Finished difference Result 1295 states and 2062 transitions. [2019-09-08 04:09:14,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:14,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 04:09:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:14,726 INFO L225 Difference]: With dead ends: 1295 [2019-09-08 04:09:14,727 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 04:09:14,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:09:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 04:09:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-08 04:09:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 04:09:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1051 transitions. [2019-09-08 04:09:14,789 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1051 transitions. Word has length 88 [2019-09-08 04:09:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:14,790 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1051 transitions. [2019-09-08 04:09:14,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1051 transitions. [2019-09-08 04:09:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 04:09:14,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:14,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:14,794 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash 594585961, now seen corresponding path program 1 times [2019-09-08 04:09:14,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:14,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:14,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:15,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:15,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:15,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:15,011 INFO L87 Difference]: Start difference. First operand 666 states and 1051 transitions. Second operand 4 states. [2019-09-08 04:09:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:15,077 INFO L93 Difference]: Finished difference Result 1295 states and 2061 transitions. [2019-09-08 04:09:15,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:15,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 04:09:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:15,083 INFO L225 Difference]: With dead ends: 1295 [2019-09-08 04:09:15,083 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 04:09:15,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:09:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 04:09:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-08 04:09:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 04:09:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1050 transitions. [2019-09-08 04:09:15,113 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1050 transitions. Word has length 89 [2019-09-08 04:09:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:15,114 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1050 transitions. [2019-09-08 04:09:15,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1050 transitions. [2019-09-08 04:09:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 04:09:15,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:15,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:15,116 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:15,117 INFO L82 PathProgramCache]: Analyzing trace with hash 305679912, now seen corresponding path program 1 times [2019-09-08 04:09:15,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:15,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:15,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:15,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:15,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:15,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:15,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:15,297 INFO L87 Difference]: Start difference. First operand 666 states and 1050 transitions. Second operand 4 states. [2019-09-08 04:09:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:15,354 INFO L93 Difference]: Finished difference Result 1295 states and 2060 transitions. [2019-09-08 04:09:15,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:15,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-08 04:09:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:15,360 INFO L225 Difference]: With dead ends: 1295 [2019-09-08 04:09:15,360 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 04:09:15,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:09:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 04:09:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-08 04:09:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 04:09:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1049 transitions. [2019-09-08 04:09:15,388 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1049 transitions. Word has length 90 [2019-09-08 04:09:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:15,389 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1049 transitions. [2019-09-08 04:09:15,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1049 transitions. [2019-09-08 04:09:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 04:09:15,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:15,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:15,391 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:15,391 INFO L82 PathProgramCache]: Analyzing trace with hash 20876485, now seen corresponding path program 1 times [2019-09-08 04:09:15,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:15,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:15,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:15,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:15,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:15,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:15,509 INFO L87 Difference]: Start difference. First operand 666 states and 1049 transitions. Second operand 4 states. [2019-09-08 04:09:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:15,568 INFO L93 Difference]: Finished difference Result 1295 states and 2059 transitions. [2019-09-08 04:09:15,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:15,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 04:09:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:15,573 INFO L225 Difference]: With dead ends: 1295 [2019-09-08 04:09:15,574 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 04:09:15,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:09:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 04:09:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-08 04:09:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 04:09:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1048 transitions. [2019-09-08 04:09:15,601 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1048 transitions. Word has length 91 [2019-09-08 04:09:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:15,601 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1048 transitions. [2019-09-08 04:09:15,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1048 transitions. [2019-09-08 04:09:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:09:15,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:15,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:15,604 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash -136745660, now seen corresponding path program 1 times [2019-09-08 04:09:15,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:15,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:15,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:15,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:15,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:09:15,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:09:15,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:09:15,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:09:15,773 INFO L87 Difference]: Start difference. First operand 666 states and 1048 transitions. Second operand 10 states. [2019-09-08 04:09:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:15,936 INFO L93 Difference]: Finished difference Result 1253 states and 1979 transitions. [2019-09-08 04:09:15,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:09:15,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-08 04:09:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:15,943 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 04:09:15,943 INFO L226 Difference]: Without dead ends: 675 [2019-09-08 04:09:15,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:09:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-08 04:09:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 673. [2019-09-08 04:09:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-08 04:09:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1057 transitions. [2019-09-08 04:09:15,985 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1057 transitions. Word has length 92 [2019-09-08 04:09:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:15,988 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-09-08 04:09:15,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:09:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1057 transitions. [2019-09-08 04:09:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:09:15,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:15,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:15,993 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:15,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:15,994 INFO L82 PathProgramCache]: Analyzing trace with hash -116408285, now seen corresponding path program 1 times [2019-09-08 04:09:15,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:15,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:15,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:15,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:15,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:16,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:16,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:09:16,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:09:16,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:09:16,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:09:16,167 INFO L87 Difference]: Start difference. First operand 673 states and 1057 transitions. Second operand 4 states. [2019-09-08 04:09:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:16,242 INFO L93 Difference]: Finished difference Result 1301 states and 2065 transitions. [2019-09-08 04:09:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:09:16,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 04:09:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:16,255 INFO L225 Difference]: With dead ends: 1301 [2019-09-08 04:09:16,255 INFO L226 Difference]: Without dead ends: 660 [2019-09-08 04:09:16,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:09:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-08 04:09:16,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-08 04:09:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 04:09:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1034 transitions. [2019-09-08 04:09:16,300 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1034 transitions. Word has length 92 [2019-09-08 04:09:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:16,302 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1034 transitions. [2019-09-08 04:09:16,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:09:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1034 transitions. [2019-09-08 04:09:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 04:09:16,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:16,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:16,309 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1615644955, now seen corresponding path program 1 times [2019-09-08 04:09:16,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:16,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:16,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:16,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:16,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:16,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:16,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:16,466 INFO L87 Difference]: Start difference. First operand 660 states and 1034 transitions. Second operand 6 states. [2019-09-08 04:09:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:16,709 INFO L93 Difference]: Finished difference Result 1241 states and 1957 transitions. [2019-09-08 04:09:16,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:16,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-08 04:09:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:16,715 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 04:09:16,715 INFO L226 Difference]: Without dead ends: 660 [2019-09-08 04:09:16,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:09:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-08 04:09:16,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-08 04:09:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 04:09:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1030 transitions. [2019-09-08 04:09:16,752 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1030 transitions. Word has length 93 [2019-09-08 04:09:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:16,752 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1030 transitions. [2019-09-08 04:09:16,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1030 transitions. [2019-09-08 04:09:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:09:16,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:16,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:16,757 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash -129454137, now seen corresponding path program 1 times [2019-09-08 04:09:16,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:16,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:16,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:16,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:16,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:16,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:16,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:16,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:16,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:16,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:16,908 INFO L87 Difference]: Start difference. First operand 660 states and 1030 transitions. Second operand 6 states. [2019-09-08 04:09:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:17,163 INFO L93 Difference]: Finished difference Result 1241 states and 1953 transitions. [2019-09-08 04:09:17,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:17,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-08 04:09:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:17,171 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 04:09:17,171 INFO L226 Difference]: Without dead ends: 660 [2019-09-08 04:09:17,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:09:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-08 04:09:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-08 04:09:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 04:09:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1026 transitions. [2019-09-08 04:09:17,209 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1026 transitions. Word has length 94 [2019-09-08 04:09:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:17,210 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1026 transitions. [2019-09-08 04:09:17,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1026 transitions. [2019-09-08 04:09:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:09:17,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:17,211 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:17,212 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1340975830, now seen corresponding path program 1 times [2019-09-08 04:09:17,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:17,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:17,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:17,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:17,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:17,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:17,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:17,388 INFO L87 Difference]: Start difference. First operand 660 states and 1026 transitions. Second operand 6 states. [2019-09-08 04:09:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:17,590 INFO L93 Difference]: Finished difference Result 1241 states and 1949 transitions. [2019-09-08 04:09:17,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:17,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 04:09:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:17,598 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 04:09:17,598 INFO L226 Difference]: Without dead ends: 660 [2019-09-08 04:09:17,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:09:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-08 04:09:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-08 04:09:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 04:09:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1022 transitions. [2019-09-08 04:09:17,626 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1022 transitions. Word has length 95 [2019-09-08 04:09:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:17,627 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1022 transitions. [2019-09-08 04:09:17,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1022 transitions. [2019-09-08 04:09:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:09:17,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:17,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:17,629 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:17,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash -293121622, now seen corresponding path program 1 times [2019-09-08 04:09:17,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:17,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:17,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:17,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:17,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:09:17,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:09:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:09:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:09:17,758 INFO L87 Difference]: Start difference. First operand 660 states and 1022 transitions. Second operand 7 states. [2019-09-08 04:09:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:17,859 INFO L93 Difference]: Finished difference Result 1241 states and 1945 transitions. [2019-09-08 04:09:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:09:17,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 04:09:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:17,867 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 04:09:17,867 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 04:09:17,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:09:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 04:09:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 04:09:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 04:09:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 988 transitions. [2019-09-08 04:09:17,905 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 988 transitions. Word has length 95 [2019-09-08 04:09:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:17,906 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 988 transitions. [2019-09-08 04:09:17,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:09:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 988 transitions. [2019-09-08 04:09:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:09:17,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:17,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:17,909 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash -282239444, now seen corresponding path program 1 times [2019-09-08 04:09:17,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:17,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:18,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:18,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:18,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:18,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:18,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:18,060 INFO L87 Difference]: Start difference. First operand 639 states and 988 transitions. Second operand 6 states. [2019-09-08 04:09:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:18,155 INFO L93 Difference]: Finished difference Result 1220 states and 1911 transitions. [2019-09-08 04:09:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:18,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 04:09:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:18,161 INFO L225 Difference]: With dead ends: 1220 [2019-09-08 04:09:18,161 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 04:09:18,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:09:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 04:09:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 04:09:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 04:09:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 987 transitions. [2019-09-08 04:09:18,187 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 987 transitions. Word has length 96 [2019-09-08 04:09:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:18,188 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 987 transitions. [2019-09-08 04:09:18,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 987 transitions. [2019-09-08 04:09:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:09:18,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:18,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:18,190 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:18,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1859946641, now seen corresponding path program 1 times [2019-09-08 04:09:18,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:18,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:18,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:18,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:18,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:18,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:18,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:18,302 INFO L87 Difference]: Start difference. First operand 639 states and 987 transitions. Second operand 6 states. [2019-09-08 04:09:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:18,401 INFO L93 Difference]: Finished difference Result 1220 states and 1910 transitions. [2019-09-08 04:09:18,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:18,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 04:09:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:18,407 INFO L225 Difference]: With dead ends: 1220 [2019-09-08 04:09:18,407 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 04:09:18,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:09:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 04:09:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 04:09:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 04:09:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 986 transitions. [2019-09-08 04:09:18,435 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 986 transitions. Word has length 97 [2019-09-08 04:09:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:18,436 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 986 transitions. [2019-09-08 04:09:18,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 986 transitions. [2019-09-08 04:09:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:09:18,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:18,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:18,439 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:18,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:18,439 INFO L82 PathProgramCache]: Analyzing trace with hash 731941009, now seen corresponding path program 1 times [2019-09-08 04:09:18,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:18,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:18,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:18,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:18,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:09:18,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:09:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:09:18,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:09:18,663 INFO L87 Difference]: Start difference. First operand 639 states and 986 transitions. Second operand 12 states. [2019-09-08 04:09:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:18,847 INFO L93 Difference]: Finished difference Result 1221 states and 1909 transitions. [2019-09-08 04:09:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:09:18,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-08 04:09:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:18,853 INFO L225 Difference]: With dead ends: 1221 [2019-09-08 04:09:18,853 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 04:09:18,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:09:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 04:09:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 04:09:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 04:09:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 985 transitions. [2019-09-08 04:09:18,878 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 985 transitions. Word has length 98 [2019-09-08 04:09:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:18,879 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 985 transitions. [2019-09-08 04:09:18,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:09:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 985 transitions. [2019-09-08 04:09:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 04:09:18,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:18,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:18,881 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:18,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2083976240, now seen corresponding path program 1 times [2019-09-08 04:09:18,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:18,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:18,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:18,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:18,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:09:19,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:19,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:19,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:19,044 INFO L87 Difference]: Start difference. First operand 639 states and 985 transitions. Second operand 6 states. [2019-09-08 04:09:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:22,832 INFO L93 Difference]: Finished difference Result 1881 states and 2985 transitions. [2019-09-08 04:09:22,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:22,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-08 04:09:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:22,843 INFO L225 Difference]: With dead ends: 1881 [2019-09-08 04:09:22,844 INFO L226 Difference]: Without dead ends: 1308 [2019-09-08 04:09:22,849 INFO L628 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-09-08 04:09:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-09-08 04:09:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1181. [2019-09-08 04:09:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-09-08 04:09:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1867 transitions. [2019-09-08 04:09:22,922 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1867 transitions. Word has length 99 [2019-09-08 04:09:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:22,923 INFO L475 AbstractCegarLoop]: Abstraction has 1181 states and 1867 transitions. [2019-09-08 04:09:22,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1867 transitions. [2019-09-08 04:09:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 04:09:22,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:22,931 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:22,931 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1126166242, now seen corresponding path program 1 times [2019-09-08 04:09:22,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:22,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:22,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:22,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:09:23,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:23,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:09:23,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:09:23,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:09:23,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:09:23,187 INFO L87 Difference]: Start difference. First operand 1181 states and 1867 transitions. Second operand 12 states. [2019-09-08 04:09:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:34,955 INFO L93 Difference]: Finished difference Result 3866 states and 6122 transitions. [2019-09-08 04:09:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:09:34,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-09-08 04:09:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:34,978 INFO L225 Difference]: With dead ends: 3866 [2019-09-08 04:09:34,978 INFO L226 Difference]: Without dead ends: 2751 [2019-09-08 04:09:34,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:09:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-09-08 04:09:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2693. [2019-09-08 04:09:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2019-09-08 04:09:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4220 transitions. [2019-09-08 04:09:35,164 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4220 transitions. Word has length 157 [2019-09-08 04:09:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:35,164 INFO L475 AbstractCegarLoop]: Abstraction has 2693 states and 4220 transitions. [2019-09-08 04:09:35,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:09:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4220 transitions. [2019-09-08 04:09:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 04:09:35,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:35,174 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:35,175 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash -525779042, now seen corresponding path program 1 times [2019-09-08 04:09:35,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:35,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:35,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 04:09:35,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:09:35,485 INFO L223 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-09-08 04:09:35,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:35,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:09:35,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:09:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 04:09:36,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:09:36,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:09:36,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:09:36,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:09:36,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:09:36,193 INFO L87 Difference]: Start difference. First operand 2693 states and 4220 transitions. Second operand 14 states. [2019-09-08 04:09:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:43,099 INFO L93 Difference]: Finished difference Result 5464 states and 8843 transitions. [2019-09-08 04:09:43,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:09:43,100 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2019-09-08 04:09:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:43,134 INFO L225 Difference]: With dead ends: 5464 [2019-09-08 04:09:43,134 INFO L226 Difference]: Without dead ends: 2837 [2019-09-08 04:09:43,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:09:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2019-09-08 04:09:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2811. [2019-09-08 04:09:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2811 states. [2019-09-08 04:09:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 4440 transitions. [2019-09-08 04:09:43,411 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 4440 transitions. Word has length 158 [2019-09-08 04:09:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:43,412 INFO L475 AbstractCegarLoop]: Abstraction has 2811 states and 4440 transitions. [2019-09-08 04:09:43,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:09:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 4440 transitions. [2019-09-08 04:09:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 04:09:43,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:43,420 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:43,420 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1788724176, now seen corresponding path program 1 times [2019-09-08 04:09:43,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:43,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:43,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:09:43,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:43,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:09:43,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:09:43,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:09:43,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:09:43,621 INFO L87 Difference]: Start difference. First operand 2811 states and 4440 transitions. Second operand 6 states. [2019-09-08 04:09:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:44,351 INFO L93 Difference]: Finished difference Result 5612 states and 9083 transitions. [2019-09-08 04:09:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:09:44,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-08 04:09:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:44,375 INFO L225 Difference]: With dead ends: 5612 [2019-09-08 04:09:44,375 INFO L226 Difference]: Without dead ends: 2851 [2019-09-08 04:09:44,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:09:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2019-09-08 04:09:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2851. [2019-09-08 04:09:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2851 states. [2019-09-08 04:09:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4458 transitions. [2019-09-08 04:09:44,544 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4458 transitions. Word has length 160 [2019-09-08 04:09:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:44,547 INFO L475 AbstractCegarLoop]: Abstraction has 2851 states and 4458 transitions. [2019-09-08 04:09:44,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:09:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4458 transitions. [2019-09-08 04:09:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:09:44,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:44,553 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:44,554 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash -400317090, now seen corresponding path program 1 times [2019-09-08 04:09:44,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:44,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:44,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:44,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 04:09:44,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:09:44,877 INFO L223 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) [2019-09-08 04:09:44,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:09:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:45,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:09:45,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:09:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:09:45,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:09:45,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:09:45,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:09:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:09:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:09:45,455 INFO L87 Difference]: Start difference. First operand 2851 states and 4458 transitions. Second operand 14 states. [2019-09-08 04:09:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:09:58,524 INFO L93 Difference]: Finished difference Result 8871 states and 14314 transitions. [2019-09-08 04:09:58,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 04:09:58,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 162 [2019-09-08 04:09:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:09:58,568 INFO L225 Difference]: With dead ends: 8871 [2019-09-08 04:09:58,568 INFO L226 Difference]: Without dead ends: 6086 [2019-09-08 04:09:58,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:09:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2019-09-08 04:09:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 5969. [2019-09-08 04:09:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5969 states. [2019-09-08 04:09:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5969 states to 5969 states and 9395 transitions. [2019-09-08 04:09:58,996 INFO L78 Accepts]: Start accepts. Automaton has 5969 states and 9395 transitions. Word has length 162 [2019-09-08 04:09:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:58,998 INFO L475 AbstractCegarLoop]: Abstraction has 5969 states and 9395 transitions. [2019-09-08 04:09:58,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:09:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 5969 states and 9395 transitions. [2019-09-08 04:09:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:09:59,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:59,023 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:59,023 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1324897512, now seen corresponding path program 1 times [2019-09-08 04:09:59,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:59,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:59,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:09:59,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:09:59,278 INFO L223 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-09-08 04:09:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:59,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 3059 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:09:59,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:09:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:09:59,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:09:59,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:09:59,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:09:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:09:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:09:59,975 INFO L87 Difference]: Start difference. First operand 5969 states and 9395 transitions. Second operand 14 states. [2019-09-08 04:10:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:13,524 INFO L93 Difference]: Finished difference Result 15352 states and 24713 transitions. [2019-09-08 04:10:13,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 04:10:13,524 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 164 [2019-09-08 04:10:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:13,575 INFO L225 Difference]: With dead ends: 15352 [2019-09-08 04:10:13,575 INFO L226 Difference]: Without dead ends: 9458 [2019-09-08 04:10:13,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:10:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9458 states. [2019-09-08 04:10:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9458 to 3003. [2019-09-08 04:10:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-09-08 04:10:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 4674 transitions. [2019-09-08 04:10:13,888 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 4674 transitions. Word has length 164 [2019-09-08 04:10:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:13,889 INFO L475 AbstractCegarLoop]: Abstraction has 3003 states and 4674 transitions. [2019-09-08 04:10:13,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:10:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 4674 transitions. [2019-09-08 04:10:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:10:13,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:13,895 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:13,895 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1267721954, now seen corresponding path program 1 times [2019-09-08 04:10:13,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:13,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:13,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:13,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:13,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:10:14,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:10:14,127 INFO L223 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-09-08 04:10:14,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:14,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 3061 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:10:14,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:10:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:10:14,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:10:14,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:10:14,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:10:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:10:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:10:14,827 INFO L87 Difference]: Start difference. First operand 3003 states and 4674 transitions. Second operand 14 states. [2019-09-08 04:10:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:25,989 INFO L93 Difference]: Finished difference Result 9253 states and 14706 transitions. [2019-09-08 04:10:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 04:10:25,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 166 [2019-09-08 04:10:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:26,028 INFO L225 Difference]: With dead ends: 9253 [2019-09-08 04:10:26,028 INFO L226 Difference]: Without dead ends: 6316 [2019-09-08 04:10:26,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 04:10:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2019-09-08 04:10:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 6073. [2019-09-08 04:10:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6073 states. [2019-09-08 04:10:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6073 states to 6073 states and 9511 transitions. [2019-09-08 04:10:26,507 INFO L78 Accepts]: Start accepts. Automaton has 6073 states and 9511 transitions. Word has length 166 [2019-09-08 04:10:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:26,508 INFO L475 AbstractCegarLoop]: Abstraction has 6073 states and 9511 transitions. [2019-09-08 04:10:26,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:10:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6073 states and 9511 transitions. [2019-09-08 04:10:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 04:10:26,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:26,526 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:26,527 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1467235422, now seen corresponding path program 1 times [2019-09-08 04:10:26,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:26,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:26,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:10:26,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:26,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:10:26,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:10:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:10:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:10:26,793 INFO L87 Difference]: Start difference. First operand 6073 states and 9511 transitions. Second operand 9 states. [2019-09-08 04:10:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:27,128 INFO L93 Difference]: Finished difference Result 8956 states and 14014 transitions. [2019-09-08 04:10:27,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:10:27,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-09-08 04:10:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:27,151 INFO L225 Difference]: With dead ends: 8956 [2019-09-08 04:10:27,151 INFO L226 Difference]: Without dead ends: 2937 [2019-09-08 04:10:27,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:10:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2019-09-08 04:10:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 2937. [2019-09-08 04:10:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2019-09-08 04:10:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 4558 transitions. [2019-09-08 04:10:27,346 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 4558 transitions. Word has length 175 [2019-09-08 04:10:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:27,346 INFO L475 AbstractCegarLoop]: Abstraction has 2937 states and 4558 transitions. [2019-09-08 04:10:27,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:10:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 4558 transitions. [2019-09-08 04:10:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 04:10:27,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:27,353 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:27,354 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash -734533476, now seen corresponding path program 1 times [2019-09-08 04:10:27,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:27,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:27,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:27,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:27,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:10:27,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:27,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:10:27,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:10:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:10:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:10:27,627 INFO L87 Difference]: Start difference. First operand 2937 states and 4558 transitions. Second operand 11 states. [2019-09-08 04:10:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:32,605 INFO L93 Difference]: Finished difference Result 5827 states and 9116 transitions. [2019-09-08 04:10:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:10:32,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2019-09-08 04:10:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:32,620 INFO L225 Difference]: With dead ends: 5827 [2019-09-08 04:10:32,620 INFO L226 Difference]: Without dead ends: 2961 [2019-09-08 04:10:32,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:10:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2019-09-08 04:10:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2925. [2019-09-08 04:10:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2019-09-08 04:10:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 4534 transitions. [2019-09-08 04:10:32,814 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 4534 transitions. Word has length 183 [2019-09-08 04:10:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:32,815 INFO L475 AbstractCegarLoop]: Abstraction has 2925 states and 4534 transitions. [2019-09-08 04:10:32,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:10:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 4534 transitions. [2019-09-08 04:10:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 04:10:32,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:32,824 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:10:32,824 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:32,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1631367738, now seen corresponding path program 1 times [2019-09-08 04:10:32,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:32,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:32,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:32,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:32,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:10:32,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:32,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:10:32,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:10:32,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:10:32,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:32,993 INFO L87 Difference]: Start difference. First operand 2925 states and 4534 transitions. Second operand 6 states. [2019-09-08 04:10:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:37,272 INFO L93 Difference]: Finished difference Result 7562 states and 11986 transitions. [2019-09-08 04:10:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:10:37,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2019-09-08 04:10:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:37,299 INFO L225 Difference]: With dead ends: 7562 [2019-09-08 04:10:37,300 INFO L226 Difference]: Without dead ends: 4708 [2019-09-08 04:10:37,311 INFO L628 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-09-08 04:10:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2019-09-08 04:10:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 4468. [2019-09-08 04:10:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4468 states. [2019-09-08 04:10:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 6951 transitions. [2019-09-08 04:10:37,638 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 6951 transitions. Word has length 197 [2019-09-08 04:10:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:37,639 INFO L475 AbstractCegarLoop]: Abstraction has 4468 states and 6951 transitions. [2019-09-08 04:10:37,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:10:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 6951 transitions. [2019-09-08 04:10:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 04:10:37,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:37,647 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:37,648 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1576213632, now seen corresponding path program 1 times [2019-09-08 04:10:37,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:37,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:37,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:10:37,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:37,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:10:37,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:10:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:10:37,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:37,890 INFO L87 Difference]: Start difference. First operand 4468 states and 6951 transitions. Second operand 6 states. [2019-09-08 04:10:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:42,325 INFO L93 Difference]: Finished difference Result 12581 states and 20057 transitions. [2019-09-08 04:10:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:10:42,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-09-08 04:10:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:42,351 INFO L225 Difference]: With dead ends: 12581 [2019-09-08 04:10:42,351 INFO L226 Difference]: Without dead ends: 8188 [2019-09-08 04:10:42,363 INFO L628 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-09-08 04:10:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8188 states. [2019-09-08 04:10:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8188 to 7766. [2019-09-08 04:10:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7766 states. [2019-09-08 04:10:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7766 states to 7766 states and 12175 transitions. [2019-09-08 04:10:43,053 INFO L78 Accepts]: Start accepts. Automaton has 7766 states and 12175 transitions. Word has length 198 [2019-09-08 04:10:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:43,054 INFO L475 AbstractCegarLoop]: Abstraction has 7766 states and 12175 transitions. [2019-09-08 04:10:43,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:10:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 7766 states and 12175 transitions. [2019-09-08 04:10:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 04:10:43,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:43,063 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:10:43,064 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:43,066 INFO L82 PathProgramCache]: Analyzing trace with hash -709434494, now seen corresponding path program 1 times [2019-09-08 04:10:43,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:43,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:43,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:10:43,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:43,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:10:43,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:10:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:10:43,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:43,236 INFO L87 Difference]: Start difference. First operand 7766 states and 12175 transitions. Second operand 6 states. [2019-09-08 04:10:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:48,211 INFO L93 Difference]: Finished difference Result 23703 states and 38271 transitions. [2019-09-08 04:10:48,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:10:48,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 199 [2019-09-08 04:10:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:48,296 INFO L225 Difference]: With dead ends: 23703 [2019-09-08 04:10:48,296 INFO L226 Difference]: Without dead ends: 16020 [2019-09-08 04:10:48,332 INFO L628 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-09-08 04:10:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16020 states. [2019-09-08 04:10:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16020 to 15051. [2019-09-08 04:10:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15051 states. [2019-09-08 04:10:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15051 states to 15051 states and 23938 transitions. [2019-09-08 04:10:50,278 INFO L78 Accepts]: Start accepts. Automaton has 15051 states and 23938 transitions. Word has length 199 [2019-09-08 04:10:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:50,279 INFO L475 AbstractCegarLoop]: Abstraction has 15051 states and 23938 transitions. [2019-09-08 04:10:50,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:10:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 15051 states and 23938 transitions. [2019-09-08 04:10:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 04:10:50,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:50,289 INFO L399 BasicCegarLoop]: trace histogram [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-09-08 04:10:50,289 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:50,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:50,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1486505156, now seen corresponding path program 1 times [2019-09-08 04:10:50,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:50,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:50,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:10:50,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:50,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:10:50,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:10:50,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:10:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:50,442 INFO L87 Difference]: Start difference. First operand 15051 states and 23938 transitions. Second operand 6 states. [2019-09-08 04:10:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:56,439 INFO L93 Difference]: Finished difference Result 49624 states and 81972 transitions. [2019-09-08 04:10:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:10:56,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2019-09-08 04:10:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:56,618 INFO L225 Difference]: With dead ends: 49624 [2019-09-08 04:10:56,618 INFO L226 Difference]: Without dead ends: 34672 [2019-09-08 04:10:56,665 INFO L628 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-09-08 04:10:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34672 states. [2019-09-08 04:10:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34672 to 32012. [2019-09-08 04:10:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32012 states. [2019-09-08 04:10:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32012 states to 32012 states and 52219 transitions. [2019-09-08 04:10:58,965 INFO L78 Accepts]: Start accepts. Automaton has 32012 states and 52219 transitions. Word has length 200 [2019-09-08 04:10:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:58,966 INFO L475 AbstractCegarLoop]: Abstraction has 32012 states and 52219 transitions. [2019-09-08 04:10:58,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:10:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32012 states and 52219 transitions. [2019-09-08 04:10:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 04:10:58,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:58,980 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:58,980 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:58,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1552652606, now seen corresponding path program 1 times [2019-09-08 04:10:58,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:58,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:58,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:58,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:58,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:10:59,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:59,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:10:59,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:10:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:10:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:59,134 INFO L87 Difference]: Start difference. First operand 32012 states and 52219 transitions. Second operand 6 states. [2019-09-08 04:11:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:09,294 INFO L93 Difference]: Finished difference Result 114509 states and 196113 transitions. [2019-09-08 04:11:09,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:11:09,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-09-08 04:11:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:09,749 INFO L225 Difference]: With dead ends: 114509 [2019-09-08 04:11:09,750 INFO L226 Difference]: Without dead ends: 82628 [2019-09-08 04:11:09,865 INFO L628 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-09-08 04:11:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82628 states. [2019-09-08 04:11:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82628 to 74621. [2019-09-08 04:11:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74621 states. [2019-09-08 04:11:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74621 states to 74621 states and 126776 transitions. [2019-09-08 04:11:18,397 INFO L78 Accepts]: Start accepts. Automaton has 74621 states and 126776 transitions. Word has length 201 [2019-09-08 04:11:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:18,397 INFO L475 AbstractCegarLoop]: Abstraction has 74621 states and 126776 transitions. [2019-09-08 04:11:18,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:11:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 74621 states and 126776 transitions. [2019-09-08 04:11:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 04:11:18,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:18,409 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:18,409 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash -255194915, now seen corresponding path program 1 times [2019-09-08 04:11:18,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:18,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:18,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:18,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:11:18,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:18,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:11:18,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:11:18,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:11:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:11:18,600 INFO L87 Difference]: Start difference. First operand 74621 states and 126776 transitions. Second operand 11 states. [2019-09-08 04:11:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:41,495 INFO L93 Difference]: Finished difference Result 247500 states and 422516 transitions. [2019-09-08 04:11:41,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:11:41,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 201 [2019-09-08 04:11:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:42,388 INFO L225 Difference]: With dead ends: 247500 [2019-09-08 04:11:42,388 INFO L226 Difference]: Without dead ends: 173074 [2019-09-08 04:11:42,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:11:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173074 states. [2019-09-08 04:11:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173074 to 169922. [2019-09-08 04:11:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169922 states. [2019-09-08 04:11:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169922 states to 169922 states and 284986 transitions. [2019-09-08 04:11:59,138 INFO L78 Accepts]: Start accepts. Automaton has 169922 states and 284986 transitions. Word has length 201 [2019-09-08 04:11:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:59,138 INFO L475 AbstractCegarLoop]: Abstraction has 169922 states and 284986 transitions. [2019-09-08 04:11:59,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:11:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 169922 states and 284986 transitions. [2019-09-08 04:11:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 04:11:59,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:59,153 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:59,153 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:59,153 INFO L82 PathProgramCache]: Analyzing trace with hash -10295992, now seen corresponding path program 1 times [2019-09-08 04:11:59,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:59,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:59,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:12:00,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:00,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:12:00,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:12:00,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:12:00,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:12:00,288 INFO L87 Difference]: Start difference. First operand 169922 states and 284986 transitions. Second operand 9 states. [2019-09-08 04:12:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:15,095 INFO L93 Difference]: Finished difference Result 344995 states and 578587 transitions. [2019-09-08 04:12:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:12:15,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-09-08 04:12:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:16,030 INFO L225 Difference]: With dead ends: 344995 [2019-09-08 04:12:16,030 INFO L226 Difference]: Without dead ends: 175268 [2019-09-08 04:12:16,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:12:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175268 states. [2019-09-08 04:12:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175268 to 172892. [2019-09-08 04:12:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172892 states. [2019-09-08 04:12:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172892 states to 172892 states and 288847 transitions. [2019-09-08 04:12:36,095 INFO L78 Accepts]: Start accepts. Automaton has 172892 states and 288847 transitions. Word has length 207 [2019-09-08 04:12:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:36,096 INFO L475 AbstractCegarLoop]: Abstraction has 172892 states and 288847 transitions. [2019-09-08 04:12:36,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:12:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 172892 states and 288847 transitions. [2019-09-08 04:12:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 04:12:36,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:36,109 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:36,109 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash 929966581, now seen corresponding path program 1 times [2019-09-08 04:12:36,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:36,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:36,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:12:36,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:36,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:12:36,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:12:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:12:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:12:36,350 INFO L87 Difference]: Start difference. First operand 172892 states and 288847 transitions. Second operand 9 states. [2019-09-08 04:12:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:54,117 INFO L93 Difference]: Finished difference Result 350341 states and 585121 transitions. [2019-09-08 04:12:54,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:12:54,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 206 [2019-09-08 04:12:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:55,498 INFO L225 Difference]: With dead ends: 350341 [2019-09-08 04:12:55,498 INFO L226 Difference]: Without dead ends: 177644 [2019-09-08 04:12:55,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:12:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177644 states. [2019-09-08 04:13:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177644 to 173189. [2019-09-08 04:13:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173189 states. [2019-09-08 04:13:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173189 states to 173189 states and 289144 transitions. [2019-09-08 04:13:16,303 INFO L78 Accepts]: Start accepts. Automaton has 173189 states and 289144 transitions. Word has length 206 [2019-09-08 04:13:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:16,304 INFO L475 AbstractCegarLoop]: Abstraction has 173189 states and 289144 transitions. [2019-09-08 04:13:16,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:13:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 173189 states and 289144 transitions. [2019-09-08 04:13:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 04:13:16,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:16,316 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:13:16,316 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:16,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash -706417850, now seen corresponding path program 1 times [2019-09-08 04:13:16,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:16,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:16,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 04:13:16,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:13:16,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:13:16,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:13:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:13:16,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:13:16,478 INFO L87 Difference]: Start difference. First operand 173189 states and 289144 transitions. Second operand 5 states. [2019-09-08 04:13:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:33,909 INFO L93 Difference]: Finished difference Result 347623 states and 579629 transitions. [2019-09-08 04:13:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:13:33,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-09-08 04:13:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:34,828 INFO L225 Difference]: With dead ends: 347623 [2019-09-08 04:13:34,829 INFO L226 Difference]: Without dead ends: 174629 [2019-09-08 04:13:35,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:13:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174629 states. [2019-09-08 04:13:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174629 to 173141. [2019-09-08 04:13:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173141 states. [2019-09-08 04:13:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173141 states to 173141 states and 289030 transitions. [2019-09-08 04:13:57,989 INFO L78 Accepts]: Start accepts. Automaton has 173141 states and 289030 transitions. Word has length 207 [2019-09-08 04:13:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:57,990 INFO L475 AbstractCegarLoop]: Abstraction has 173141 states and 289030 transitions. [2019-09-08 04:13:57,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:13:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 173141 states and 289030 transitions. [2019-09-08 04:13:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 04:13:57,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:57,996 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:13:57,996 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:57,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash 532042132, now seen corresponding path program 1 times [2019-09-08 04:13:57,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:13:58,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:13:58,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:13:58,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:13:58,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:13:58,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:13:58,229 INFO L87 Difference]: Start difference. First operand 173141 states and 289030 transitions. Second operand 8 states. [2019-09-08 04:14:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:14:35,050 INFO L93 Difference]: Finished difference Result 542500 states and 921243 transitions. [2019-09-08 04:14:35,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:14:35,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2019-09-08 04:14:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:14:37,360 INFO L225 Difference]: With dead ends: 542500 [2019-09-08 04:14:37,361 INFO L226 Difference]: Without dead ends: 369290 [2019-09-08 04:14:37,983 INFO L628 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-09-08 04:14:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369290 states. [2019-09-08 04:15:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369290 to 369192. [2019-09-08 04:15:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369192 states. [2019-09-08 04:15:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369192 states to 369192 states and 620981 transitions. [2019-09-08 04:15:29,732 INFO L78 Accepts]: Start accepts. Automaton has 369192 states and 620981 transitions. Word has length 216 [2019-09-08 04:15:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:29,733 INFO L475 AbstractCegarLoop]: Abstraction has 369192 states and 620981 transitions. [2019-09-08 04:15:29,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:15:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 369192 states and 620981 transitions. [2019-09-08 04:15:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 04:15:29,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:29,739 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:15:29,739 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:29,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1457555302, now seen corresponding path program 1 times [2019-09-08 04:15:29,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:29,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:29,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:29,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:29,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 04:15:29,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:15:29,887 INFO L223 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-09-08 04:15:29,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:30,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 3452 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:15:30,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:15:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-08 04:15:30,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:15:30,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 04:15:30,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:15:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:15:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:15:30,459 INFO L87 Difference]: Start difference. First operand 369192 states and 620981 transitions. Second operand 9 states. [2019-09-08 04:16:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:20,342 INFO L93 Difference]: Finished difference Result 740623 states and 1300072 transitions. [2019-09-08 04:16:20,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:16:20,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2019-09-08 04:16:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:22,217 INFO L225 Difference]: With dead ends: 740623 [2019-09-08 04:16:22,217 INFO L226 Difference]: Without dead ends: 371502 [2019-09-08 04:16:24,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:16:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371502 states. [2019-09-08 04:17:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371502 to 371502. [2019-09-08 04:17:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371502 states. [2019-09-08 04:17:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371502 states to 371502 states and 623951 transitions. [2019-09-08 04:17:08,897 INFO L78 Accepts]: Start accepts. Automaton has 371502 states and 623951 transitions. Word has length 216 [2019-09-08 04:17:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:17:08,898 INFO L475 AbstractCegarLoop]: Abstraction has 371502 states and 623951 transitions. [2019-09-08 04:17:08,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:17:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 371502 states and 623951 transitions. [2019-09-08 04:17:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 04:17:08,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:17:08,905 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:17:08,905 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:17:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:17:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash -250906525, now seen corresponding path program 1 times [2019-09-08 04:17:08,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:17:08,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:17:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:08,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:17:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 04:17:10,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:17:10,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:17:10,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:17:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:17:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:17:10,768 INFO L87 Difference]: Start difference. First operand 371502 states and 623951 transitions. Second operand 7 states. [2019-09-08 04:17:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:17:55,159 INFO L93 Difference]: Finished difference Result 726372 states and 1231422 transitions. [2019-09-08 04:17:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:17:55,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 219 [2019-09-08 04:17:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:17:57,111 INFO L225 Difference]: With dead ends: 726372 [2019-09-08 04:17:57,111 INFO L226 Difference]: Without dead ends: 388945 [2019-09-08 04:17:59,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:17:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388945 states. [2019-09-08 04:18:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388945 to 383184. [2019-09-08 04:18:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383184 states. [2019-09-08 04:18:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383184 states to 383184 states and 639884 transitions. [2019-09-08 04:18:57,625 INFO L78 Accepts]: Start accepts. Automaton has 383184 states and 639884 transitions. Word has length 219 [2019-09-08 04:18:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:18:57,625 INFO L475 AbstractCegarLoop]: Abstraction has 383184 states and 639884 transitions. [2019-09-08 04:18:57,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:18:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 383184 states and 639884 transitions. [2019-09-08 04:18:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 04:18:57,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:18:57,632 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:18:57,634 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:18:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:18:57,634 INFO L82 PathProgramCache]: Analyzing trace with hash -980417350, now seen corresponding path program 1 times [2019-09-08 04:18:57,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:18:57,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:18:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:18:57,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:18:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:18:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:18:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 04:18:57,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:18:57,764 INFO L223 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) [2019-09-08 04:18:57,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:18:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:18:58,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 3457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:18:58,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:18:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:18:58,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:18:58,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 04:18:58,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:18:58,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:18:58,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:18:58,514 INFO L87 Difference]: Start difference. First operand 383184 states and 639884 transitions. Second operand 6 states.