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_spec14_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:42:23,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:42:23,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:42:24,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:42:24,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:42:24,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:42:24,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:42:24,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:42:24,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:42:24,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:42:24,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:42:24,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:42:24,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:42:24,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:42:24,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:42:24,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:42:24,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:42:24,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:42:24,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:42:24,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:42:24,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:42:24,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:42:24,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:42:24,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:42:24,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:42:24,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:42:24,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:42:24,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:42:24,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:42:24,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:42:24,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:42:24,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:42:24,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:42:24,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:42:24,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:42:24,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:42:24,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:42:24,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:42:24,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:42:24,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:42:24,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:42:24,044 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 03:42:24,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:42:24,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:42:24,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:42:24,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:42:24,061 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:42:24,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:42:24,062 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:42:24,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:42:24,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:42:24,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:42:24,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:42:24,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:42:24,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:42:24,063 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:42:24,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:42:24,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:42:24,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:42:24,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:42:24,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:42:24,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:42:24,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:42:24,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:42:24,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:42:24,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:42:24,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:42:24,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:42:24,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:42:24,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:42:24,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:42:24,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:42:24,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:42:24,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:42:24,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:42:24,121 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:42:24,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product27.cil.c [2019-09-08 03:42:24,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb3bd21/79bea3acfe9741fca66ff0a24b03aee4/FLAG683a706be [2019-09-08 03:42:24,819 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:42:24,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product27.cil.c [2019-09-08 03:42:24,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb3bd21/79bea3acfe9741fca66ff0a24b03aee4/FLAG683a706be [2019-09-08 03:42:25,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb3bd21/79bea3acfe9741fca66ff0a24b03aee4 [2019-09-08 03:42:25,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:42:25,089 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:42:25,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:42:25,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:42:25,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:42:25,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:42:25" (1/1) ... [2019-09-08 03:42:25,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d0047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:25, skipping insertion in model container [2019-09-08 03:42:25,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:42:25" (1/1) ... [2019-09-08 03:42:25,104 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:42:25,187 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:42:25,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:42:25,935 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:42:26,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:42:26,222 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:42:26,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26 WrapperNode [2019-09-08 03:42:26,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:42:26,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:42:26,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:42:26,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:42:26,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (1/1) ... [2019-09-08 03:42:26,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (1/1) ... [2019-09-08 03:42:26,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (1/1) ... [2019-09-08 03:42:26,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (1/1) ... [2019-09-08 03:42:26,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (1/1) ... [2019-09-08 03:42:26,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (1/1) ... [2019-09-08 03:42:26,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (1/1) ... [2019-09-08 03:42:26,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:42:26,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:42:26,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:42:26,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:42:26,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (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 03:42:26,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:42:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:42:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:42:26,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:42:26,533 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:42:26,533 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:42:26,533 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:42:26,533 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:42:26,534 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:42:26,534 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:42:26,534 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:42:26,534 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:42:26,535 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:42:26,535 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:42:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:42:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:42:26,538 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:42:26,539 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:42:26,539 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:42:26,540 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:42:26,540 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:42:26,540 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:42:26,541 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:42:26,541 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:42:26,541 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:42:26,541 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:42:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:42:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:42:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:42:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:42:26,543 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:42:26,543 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:42:26,543 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:42:26,544 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:42:26,544 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:42:26,544 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:42:26,544 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:42:26,545 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:42:26,545 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:42:26,545 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:42:26,546 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:42:26,546 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:42:26,546 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:42:26,546 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:42:26,547 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:42:26,547 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:42:26,548 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:42:26,548 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:42:26,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:42:26,548 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:42:26,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:42:26,549 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:42:26,549 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:42:26,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:42:26,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:42:26,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:42:26,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:42:26,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:42:26,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:42:26,552 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:42:26,552 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:42:26,552 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:42:26,552 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:42:26,552 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:42:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:42:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:42:26,554 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:42:26,554 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:42:26,554 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:42:26,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:42:26,555 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:42:26,555 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:42:26,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:42:26,556 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:42:26,557 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:42:26,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:42:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:42:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:42:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:42:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:42:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:42:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:42:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:42:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:42:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:42:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:42:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:42:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:42:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:42:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:42:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:42:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:42:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:42:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:42:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:42:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:42:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:42:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:42:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:42:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:42:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:42:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:42:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:42:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:42:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:42:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:42:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:42:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:42:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:42:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:42:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:42:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:42:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:42:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:42:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:42:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:42:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:42:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:42:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:42:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:42:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:42:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:42:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:42:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:42:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:42:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:42:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:42:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:42:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:42:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:42:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:42:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:42:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:42:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:42:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:42:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:42:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:42:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:42:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:42:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:42:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:42:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:42:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:42:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:42:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:42:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:42:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:42:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:42:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:42:26,591 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:42:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:42:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:42:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:42:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:42:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:42:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:42:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:42:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:42:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:42:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:42:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:42:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:42:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:42:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:42:29,281 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:42:29,281 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:42:29,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:42:29 BoogieIcfgContainer [2019-09-08 03:42:29,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:42:29,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:42:29,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:42:29,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:42:29,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:42:25" (1/3) ... [2019-09-08 03:42:29,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0fe4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:42:29, skipping insertion in model container [2019-09-08 03:42:29,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:26" (2/3) ... [2019-09-08 03:42:29,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0fe4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:42:29, skipping insertion in model container [2019-09-08 03:42:29,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:42:29" (3/3) ... [2019-09-08 03:42:29,291 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product27.cil.c [2019-09-08 03:42:29,301 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:42:29,311 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:42:29,330 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:42:29,387 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:42:29,388 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:42:29,388 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:42:29,388 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:42:29,388 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:42:29,388 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:42:29,388 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:42:29,389 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:42:29,389 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:42:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states. [2019-09-08 03:42:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 03:42:29,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:29,476 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:29,481 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1973380872, now seen corresponding path program 1 times [2019-09-08 03:42:29,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:29,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:29,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:29,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:29,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:30,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:30,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:30,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:30,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:30,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:30,124 INFO L87 Difference]: Start difference. First operand 751 states. Second operand 4 states. [2019-09-08 03:42:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:30,345 INFO L93 Difference]: Finished difference Result 1200 states and 1920 transitions. [2019-09-08 03:42:30,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:42:30,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 03:42:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:30,384 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 03:42:30,384 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 03:42:30,398 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 03:42:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 03:42:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-09-08 03:42:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 03:42:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 951 transitions. [2019-09-08 03:42:30,528 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 951 transitions. Word has length 135 [2019-09-08 03:42:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:30,528 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 951 transitions. [2019-09-08 03:42:30,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 951 transitions. [2019-09-08 03:42:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 03:42:30,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:30,535 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:30,535 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:30,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:30,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1520755359, now seen corresponding path program 1 times [2019-09-08 03:42:30,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:30,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:30,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:30,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:30,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:30,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:30,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:30,831 INFO L87 Difference]: Start difference. First operand 603 states and 951 transitions. Second operand 4 states. [2019-09-08 03:42:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:30,932 INFO L93 Difference]: Finished difference Result 1173 states and 1863 transitions. [2019-09-08 03:42:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:30,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 03:42:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:30,939 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:42:30,939 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 03:42:30,943 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 03:42:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 03:42:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-09-08 03:42:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 03:42:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 950 transitions. [2019-09-08 03:42:30,974 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 950 transitions. Word has length 136 [2019-09-08 03:42:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:30,975 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 950 transitions. [2019-09-08 03:42:30,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 950 transitions. [2019-09-08 03:42:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 03:42:30,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:30,981 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:30,981 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash -25629804, now seen corresponding path program 1 times [2019-09-08 03:42:30,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:30,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:31,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:31,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:31,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:31,187 INFO L87 Difference]: Start difference. First operand 603 states and 950 transitions. Second operand 4 states. [2019-09-08 03:42:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:31,274 INFO L93 Difference]: Finished difference Result 1173 states and 1862 transitions. [2019-09-08 03:42:31,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:31,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-08 03:42:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:31,280 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:42:31,281 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 03:42:31,284 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 03:42:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 03:42:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-09-08 03:42:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 03:42:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 949 transitions. [2019-09-08 03:42:31,310 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 949 transitions. Word has length 137 [2019-09-08 03:42:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:31,311 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 949 transitions. [2019-09-08 03:42:31,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 949 transitions. [2019-09-08 03:42:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:42:31,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:31,316 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:31,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash -572741315, now seen corresponding path program 1 times [2019-09-08 03:42:31,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:31,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:31,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:31,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:31,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:31,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:31,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:31,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:31,513 INFO L87 Difference]: Start difference. First operand 603 states and 949 transitions. Second operand 4 states. [2019-09-08 03:42:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:31,599 INFO L93 Difference]: Finished difference Result 1173 states and 1861 transitions. [2019-09-08 03:42:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:31,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 03:42:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:31,606 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:42:31,606 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 03:42:31,611 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 03:42:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 03:42:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-09-08 03:42:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 03:42:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 948 transitions. [2019-09-08 03:42:31,644 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 948 transitions. Word has length 138 [2019-09-08 03:42:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:31,644 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 948 transitions. [2019-09-08 03:42:31,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 948 transitions. [2019-09-08 03:42:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 03:42:31,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:31,650 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:31,651 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:31,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:31,651 INFO L82 PathProgramCache]: Analyzing trace with hash -4692432, now seen corresponding path program 1 times [2019-09-08 03:42:31,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:31,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:31,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:31,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:31,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:31,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:31,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:31,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:31,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:31,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:31,814 INFO L87 Difference]: Start difference. First operand 603 states and 948 transitions. Second operand 4 states. [2019-09-08 03:42:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:31,895 INFO L93 Difference]: Finished difference Result 1173 states and 1860 transitions. [2019-09-08 03:42:31,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:31,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-08 03:42:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:31,911 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:42:31,912 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 03:42:31,916 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 03:42:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 03:42:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-09-08 03:42:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 03:42:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 947 transitions. [2019-09-08 03:42:31,949 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 947 transitions. Word has length 139 [2019-09-08 03:42:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:31,950 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 947 transitions. [2019-09-08 03:42:31,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 947 transitions. [2019-09-08 03:42:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:42:31,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:31,956 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:31,957 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:31,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:31,957 INFO L82 PathProgramCache]: Analyzing trace with hash 773590297, now seen corresponding path program 1 times [2019-09-08 03:42:31,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:31,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:32,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:32,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:42:32,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:42:32,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:42:32,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:42:32,274 INFO L87 Difference]: Start difference. First operand 603 states and 947 transitions. Second operand 10 states. [2019-09-08 03:42:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:32,454 INFO L93 Difference]: Finished difference Result 1178 states and 1867 transitions. [2019-09-08 03:42:32,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:42:32,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 03:42:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:32,464 INFO L225 Difference]: With dead ends: 1178 [2019-09-08 03:42:32,465 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:42:32,468 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 03:42:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:42:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-09-08 03:42:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-08 03:42:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 957 transitions. [2019-09-08 03:42:32,495 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 957 transitions. Word has length 140 [2019-09-08 03:42:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:32,495 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 957 transitions. [2019-09-08 03:42:32,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:42:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 957 transitions. [2019-09-08 03:42:32,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:42:32,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:32,500 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:32,501 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:32,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:32,501 INFO L82 PathProgramCache]: Analyzing trace with hash -212992392, now seen corresponding path program 1 times [2019-09-08 03:42:32,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:32,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:32,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:32,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:32,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:32,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:32,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:32,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:32,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:32,607 INFO L87 Difference]: Start difference. First operand 610 states and 957 transitions. Second operand 4 states. [2019-09-08 03:42:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:32,672 INFO L93 Difference]: Finished difference Result 1179 states and 1868 transitions. [2019-09-08 03:42:32,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:42:32,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 03:42:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:32,679 INFO L225 Difference]: With dead ends: 1179 [2019-09-08 03:42:32,679 INFO L226 Difference]: Without dead ends: 606 [2019-09-08 03:42:32,684 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 03:42:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-09-08 03:42:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-09-08 03:42:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-08 03:42:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 950 transitions. [2019-09-08 03:42:32,713 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 950 transitions. Word has length 140 [2019-09-08 03:42:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:32,714 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 950 transitions. [2019-09-08 03:42:32,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 950 transitions. [2019-09-08 03:42:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 03:42:32,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:32,721 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:32,721 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:32,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash -429509062, now seen corresponding path program 1 times [2019-09-08 03:42:32,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:32,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:32,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:32,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:32,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:32,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:32,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:32,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:32,894 INFO L87 Difference]: Start difference. First operand 606 states and 950 transitions. Second operand 6 states. [2019-09-08 03:42:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:33,280 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2019-09-08 03:42:33,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:42:33,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 03:42:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:33,288 INFO L225 Difference]: With dead ends: 1192 [2019-09-08 03:42:33,288 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 03:42:33,292 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 03:42:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 03:42:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2019-09-08 03:42:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:42:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-09-08 03:42:33,319 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 141 [2019-09-08 03:42:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:33,320 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-09-08 03:42:33,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-09-08 03:42:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 03:42:33,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:33,325 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:33,325 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash 16704540, now seen corresponding path program 1 times [2019-09-08 03:42:33,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:33,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:33,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:33,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:33,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:33,472 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 6 states. [2019-09-08 03:42:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:33,707 INFO L93 Difference]: Finished difference Result 1155 states and 1807 transitions. [2019-09-08 03:42:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:42:33,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 03:42:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:33,714 INFO L225 Difference]: With dead ends: 1155 [2019-09-08 03:42:33,715 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 03:42:33,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 03:42:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 03:42:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 03:42:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:42:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 947 transitions. [2019-09-08 03:42:33,750 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 947 transitions. Word has length 142 [2019-09-08 03:42:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:33,751 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 947 transitions. [2019-09-08 03:42:33,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 947 transitions. [2019-09-08 03:42:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 03:42:33,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:33,756 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:33,756 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash -155948033, now seen corresponding path program 1 times [2019-09-08 03:42:33,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:33,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:33,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:33,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:33,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:33,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:33,896 INFO L87 Difference]: Start difference. First operand 611 states and 947 transitions. Second operand 6 states. [2019-09-08 03:42:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:34,199 INFO L93 Difference]: Finished difference Result 1155 states and 1803 transitions. [2019-09-08 03:42:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:42:34,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 03:42:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:34,208 INFO L225 Difference]: With dead ends: 1155 [2019-09-08 03:42:34,209 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 03:42:34,214 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 03:42:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 03:42:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 03:42:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:42:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 943 transitions. [2019-09-08 03:42:34,255 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 943 transitions. Word has length 143 [2019-09-08 03:42:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:34,256 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 943 transitions. [2019-09-08 03:42:34,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 943 transitions. [2019-09-08 03:42:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 03:42:34,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:34,302 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:34,302 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash 121383039, now seen corresponding path program 1 times [2019-09-08 03:42:34,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:34,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:34,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:34,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:34,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:42:34,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:42:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:42:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:42:34,496 INFO L87 Difference]: Start difference. First operand 611 states and 943 transitions. Second operand 7 states. [2019-09-08 03:42:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:34,617 INFO L93 Difference]: Finished difference Result 1158 states and 1803 transitions. [2019-09-08 03:42:34,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:42:34,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-08 03:42:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:34,624 INFO L225 Difference]: With dead ends: 1158 [2019-09-08 03:42:34,624 INFO L226 Difference]: Without dead ends: 593 [2019-09-08 03:42:34,629 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 03:42:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-08 03:42:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2019-09-08 03:42:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:42:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 906 transitions. [2019-09-08 03:42:34,650 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 906 transitions. Word has length 143 [2019-09-08 03:42:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:34,650 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 906 transitions. [2019-09-08 03:42:34,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:42:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 906 transitions. [2019-09-08 03:42:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 03:42:34,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:34,658 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:34,659 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:34,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1961384449, now seen corresponding path program 1 times [2019-09-08 03:42:34,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:34,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:34,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:34,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:34,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:34,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:34,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:34,804 INFO L87 Difference]: Start difference. First operand 590 states and 906 transitions. Second operand 6 states. [2019-09-08 03:42:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:34,940 INFO L93 Difference]: Finished difference Result 1134 states and 1762 transitions. [2019-09-08 03:42:34,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:42:34,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 03:42:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:34,945 INFO L225 Difference]: With dead ends: 1134 [2019-09-08 03:42:34,945 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:42:34,949 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 03:42:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:42:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 03:42:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:42:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 905 transitions. [2019-09-08 03:42:34,970 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 905 transitions. Word has length 144 [2019-09-08 03:42:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:34,971 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 905 transitions. [2019-09-08 03:42:34,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 905 transitions. [2019-09-08 03:42:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 03:42:34,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:34,978 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:34,978 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:34,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2053809604, now seen corresponding path program 1 times [2019-09-08 03:42:34,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:34,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:34,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:34,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:34,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:35,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:35,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:35,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:35,103 INFO L87 Difference]: Start difference. First operand 590 states and 905 transitions. Second operand 6 states. [2019-09-08 03:42:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:35,229 INFO L93 Difference]: Finished difference Result 1134 states and 1761 transitions. [2019-09-08 03:42:35,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:42:35,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 03:42:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:35,234 INFO L225 Difference]: With dead ends: 1134 [2019-09-08 03:42:35,234 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:42:35,238 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 03:42:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:42:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 03:42:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:42:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 904 transitions. [2019-09-08 03:42:35,262 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 904 transitions. Word has length 145 [2019-09-08 03:42:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:35,263 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 904 transitions. [2019-09-08 03:42:35,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 904 transitions. [2019-09-08 03:42:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 03:42:35,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:35,287 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:35,287 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:35,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:35,287 INFO L82 PathProgramCache]: Analyzing trace with hash -496350234, now seen corresponding path program 1 times [2019-09-08 03:42:35,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:35,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:35,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:35,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:35,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:35,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:35,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 03:42:35,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:42:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:42:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:42:35,476 INFO L87 Difference]: Start difference. First operand 590 states and 904 transitions. Second operand 12 states. [2019-09-08 03:42:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:35,738 INFO L93 Difference]: Finished difference Result 1140 states and 1771 transitions. [2019-09-08 03:42:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:42:35,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-08 03:42:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:35,743 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 03:42:35,743 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 03:42:35,746 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 03:42:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 03:42:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2019-09-08 03:42:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 03:42:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 910 transitions. [2019-09-08 03:42:35,766 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 910 transitions. Word has length 146 [2019-09-08 03:42:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:35,767 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 910 transitions. [2019-09-08 03:42:35,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:42:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 910 transitions. [2019-09-08 03:42:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 03:42:35,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:35,771 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:35,772 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash 94623585, now seen corresponding path program 1 times [2019-09-08 03:42:35,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:35,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:35,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:35,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:35,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:42:35,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:35,961 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) [2019-09-08 03:42:35,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:42:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:36,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:42:36,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:42:36,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:42:36,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-08 03:42:36,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:42:36,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:42:36,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:42:36,513 INFO L87 Difference]: Start difference. First operand 595 states and 910 transitions. Second operand 11 states. [2019-09-08 03:42:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:50,818 INFO L93 Difference]: Finished difference Result 2857 states and 4614 transitions. [2019-09-08 03:42:50,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:42:50,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2019-09-08 03:42:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:50,849 INFO L225 Difference]: With dead ends: 2857 [2019-09-08 03:42:50,849 INFO L226 Difference]: Without dead ends: 2315 [2019-09-08 03:42:50,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:42:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2019-09-08 03:42:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2254. [2019-09-08 03:42:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-09-08 03:42:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3640 transitions. [2019-09-08 03:42:51,046 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3640 transitions. Word has length 147 [2019-09-08 03:42:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:51,047 INFO L475 AbstractCegarLoop]: Abstraction has 2254 states and 3640 transitions. [2019-09-08 03:42:51,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:42:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3640 transitions. [2019-09-08 03:42:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 03:42:51,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:51,054 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:42:51,054 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:51,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1245425385, now seen corresponding path program 1 times [2019-09-08 03:42:51,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:51,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:51,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:42:51,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:51,396 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:42:51,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:51,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:42:51,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:42:52,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:42:52,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:42:52,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:42:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:42:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:42:52,085 INFO L87 Difference]: Start difference. First operand 2254 states and 3640 transitions. Second operand 9 states. [2019-09-08 03:42:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:53,658 INFO L93 Difference]: Finished difference Result 4497 states and 7460 transitions. [2019-09-08 03:42:53,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:42:53,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-09-08 03:42:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:53,686 INFO L225 Difference]: With dead ends: 4497 [2019-09-08 03:42:53,686 INFO L226 Difference]: Without dead ends: 2296 [2019-09-08 03:42:53,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:42:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-09-08 03:42:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2019-09-08 03:42:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-09-08 03:42:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3646 transitions. [2019-09-08 03:42:53,846 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3646 transitions. Word has length 150 [2019-09-08 03:42:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:53,847 INFO L475 AbstractCegarLoop]: Abstraction has 2296 states and 3646 transitions. [2019-09-08 03:42:53,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:42:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3646 transitions. [2019-09-08 03:42:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 03:42:53,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:53,852 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:42:53,852 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:53,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:53,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1816340371, now seen corresponding path program 1 times [2019-09-08 03:42:53,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:53,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:53,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:53,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:53,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:42:54,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:54,068 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 03:42:54,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:54,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:42:54,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:42:54,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:42:54,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:42:54,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:42:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:42:54,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:42:54,556 INFO L87 Difference]: Start difference. First operand 2296 states and 3646 transitions. Second operand 13 states. [2019-09-08 03:43:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:05,466 INFO L93 Difference]: Finished difference Result 7281 states and 11927 transitions. [2019-09-08 03:43:05,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:43:05,466 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 157 [2019-09-08 03:43:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:05,514 INFO L225 Difference]: With dead ends: 7281 [2019-09-08 03:43:05,514 INFO L226 Difference]: Without dead ends: 5038 [2019-09-08 03:43:05,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:43:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5038 states. [2019-09-08 03:43:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5038 to 4965. [2019-09-08 03:43:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4965 states. [2019-09-08 03:43:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 8005 transitions. [2019-09-08 03:43:05,804 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 8005 transitions. Word has length 157 [2019-09-08 03:43:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:05,805 INFO L475 AbstractCegarLoop]: Abstraction has 4965 states and 8005 transitions. [2019-09-08 03:43:05,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:43:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 8005 transitions. [2019-09-08 03:43:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:43:05,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:05,815 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:05,815 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash -998466541, now seen corresponding path program 1 times [2019-09-08 03:43:05,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:05,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:05,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:05,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:05,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:43:06,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:06,016 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) [2019-09-08 03:43:06,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:06,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:43:06,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:43:06,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:06,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:43:06,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:43:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:43:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:06,563 INFO L87 Difference]: Start difference. First operand 4965 states and 8005 transitions. Second operand 13 states. [2019-09-08 03:43:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:17,460 INFO L93 Difference]: Finished difference Result 14187 states and 23363 transitions. [2019-09-08 03:43:17,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:43:17,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 156 [2019-09-08 03:43:17,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:17,548 INFO L225 Difference]: With dead ends: 14187 [2019-09-08 03:43:17,548 INFO L226 Difference]: Without dead ends: 9281 [2019-09-08 03:43:17,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:43:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2019-09-08 03:43:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 9126. [2019-09-08 03:43:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9126 states. [2019-09-08 03:43:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9126 states to 9126 states and 14803 transitions. [2019-09-08 03:43:18,103 INFO L78 Accepts]: Start accepts. Automaton has 9126 states and 14803 transitions. Word has length 156 [2019-09-08 03:43:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:18,103 INFO L475 AbstractCegarLoop]: Abstraction has 9126 states and 14803 transitions. [2019-09-08 03:43:18,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:43:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 9126 states and 14803 transitions. [2019-09-08 03:43:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:43:18,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:18,115 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:18,115 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2032020055, now seen corresponding path program 1 times [2019-09-08 03:43:18,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:18,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:18,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:43:18,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:18,285 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) [2019-09-08 03:43:18,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:18,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:43:18,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 03:43:18,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:18,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:43:18,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:43:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:43:18,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:18,896 INFO L87 Difference]: Start difference. First operand 9126 states and 14803 transitions. Second operand 13 states. [2019-09-08 03:43:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:31,161 INFO L93 Difference]: Finished difference Result 23597 states and 39057 transitions. [2019-09-08 03:43:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 03:43:31,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-09-08 03:43:31,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:31,266 INFO L225 Difference]: With dead ends: 23597 [2019-09-08 03:43:31,267 INFO L226 Difference]: Without dead ends: 14536 [2019-09-08 03:43:31,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:43:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14536 states. [2019-09-08 03:43:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14536 to 14399. [2019-09-08 03:43:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14399 states. [2019-09-08 03:43:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14399 states to 14399 states and 23322 transitions. [2019-09-08 03:43:32,261 INFO L78 Accepts]: Start accepts. Automaton has 14399 states and 23322 transitions. Word has length 159 [2019-09-08 03:43:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:32,265 INFO L475 AbstractCegarLoop]: Abstraction has 14399 states and 23322 transitions. [2019-09-08 03:43:32,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:43:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 14399 states and 23322 transitions. [2019-09-08 03:43:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 03:43:32,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:32,286 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:43:32,287 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1680497566, now seen corresponding path program 1 times [2019-09-08 03:43:32,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:32,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:43:33,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:33,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:43:33,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:33,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:33,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:33,322 INFO L87 Difference]: Start difference. First operand 14399 states and 23322 transitions. Second operand 9 states. [2019-09-08 03:43:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:33,994 INFO L93 Difference]: Finished difference Result 20238 states and 32666 transitions. [2019-09-08 03:43:33,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:43:33,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-09-08 03:43:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:34,041 INFO L225 Difference]: With dead ends: 20238 [2019-09-08 03:43:34,042 INFO L226 Difference]: Without dead ends: 5886 [2019-09-08 03:43:34,097 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 03:43:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5886 states. [2019-09-08 03:43:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5886 to 5882. [2019-09-08 03:43:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5882 states. [2019-09-08 03:43:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5882 states to 5882 states and 9381 transitions. [2019-09-08 03:43:34,417 INFO L78 Accepts]: Start accepts. Automaton has 5882 states and 9381 transitions. Word has length 162 [2019-09-08 03:43:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:34,418 INFO L475 AbstractCegarLoop]: Abstraction has 5882 states and 9381 transitions. [2019-09-08 03:43:34,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 5882 states and 9381 transitions. [2019-09-08 03:43:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 03:43:34,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:34,424 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:34,425 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:34,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:34,425 INFO L82 PathProgramCache]: Analyzing trace with hash -725573071, now seen corresponding path program 1 times [2019-09-08 03:43:34,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:34,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:34,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:34,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:43:34,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:34,610 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:34,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:35,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:43:35,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 03:43:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:35,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-09-08 03:43:35,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:43:35,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:43:35,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:35,134 INFO L87 Difference]: Start difference. First operand 5882 states and 9381 transitions. Second operand 13 states. [2019-09-08 03:43:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:45,115 INFO L93 Difference]: Finished difference Result 12158 states and 19537 transitions. [2019-09-08 03:43:45,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:43:45,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 165 [2019-09-08 03:43:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:45,154 INFO L225 Difference]: With dead ends: 12158 [2019-09-08 03:43:45,154 INFO L226 Difference]: Without dead ends: 6329 [2019-09-08 03:43:45,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:43:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6329 states. [2019-09-08 03:43:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6329 to 6238. [2019-09-08 03:43:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6238 states. [2019-09-08 03:43:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6238 states to 6238 states and 9972 transitions. [2019-09-08 03:43:45,503 INFO L78 Accepts]: Start accepts. Automaton has 6238 states and 9972 transitions. Word has length 165 [2019-09-08 03:43:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:45,505 INFO L475 AbstractCegarLoop]: Abstraction has 6238 states and 9972 transitions. [2019-09-08 03:43:45,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:43:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6238 states and 9972 transitions. [2019-09-08 03:43:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 03:43:45,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:45,511 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:45,511 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2105437858, now seen corresponding path program 1 times [2019-09-08 03:43:45,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:45,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:45,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:43:45,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:45,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:43:45,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:46,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 2684 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 03:43:46,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 03:43:46,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:46,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:43:46,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:43:46,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:43:46,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:46,258 INFO L87 Difference]: Start difference. First operand 6238 states and 9972 transitions. Second operand 13 states. [2019-09-08 03:44:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:00,942 INFO L93 Difference]: Finished difference Result 12343 states and 19845 transitions. [2019-09-08 03:44:00,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:44:00,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2019-09-08 03:44:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:00,971 INFO L225 Difference]: With dead ends: 12343 [2019-09-08 03:44:00,971 INFO L226 Difference]: Without dead ends: 6158 [2019-09-08 03:44:01,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 03:44:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2019-09-08 03:44:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 6089. [2019-09-08 03:44:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6089 states. [2019-09-08 03:44:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 9681 transitions. [2019-09-08 03:44:01,290 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 9681 transitions. Word has length 172 [2019-09-08 03:44:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:01,290 INFO L475 AbstractCegarLoop]: Abstraction has 6089 states and 9681 transitions. [2019-09-08 03:44:01,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:44:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 9681 transitions. [2019-09-08 03:44:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 03:44:01,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:01,296 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:44:01,296 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:01,297 INFO L82 PathProgramCache]: Analyzing trace with hash -567982731, now seen corresponding path program 1 times [2019-09-08 03:44:01,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:01,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:44:01,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:01,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:44:01,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:44:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:44:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:44:01,505 INFO L87 Difference]: Start difference. First operand 6089 states and 9681 transitions. Second operand 7 states. [2019-09-08 03:44:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:02,051 INFO L93 Difference]: Finished difference Result 12183 states and 19410 transitions. [2019-09-08 03:44:02,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:44:02,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-09-08 03:44:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:02,091 INFO L225 Difference]: With dead ends: 12183 [2019-09-08 03:44:02,091 INFO L226 Difference]: Without dead ends: 6147 [2019-09-08 03:44:02,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:44:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2019-09-08 03:44:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 6109. [2019-09-08 03:44:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6109 states. [2019-09-08 03:44:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6109 states to 6109 states and 9701 transitions. [2019-09-08 03:44:02,462 INFO L78 Accepts]: Start accepts. Automaton has 6109 states and 9701 transitions. Word has length 179 [2019-09-08 03:44:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:02,462 INFO L475 AbstractCegarLoop]: Abstraction has 6109 states and 9701 transitions. [2019-09-08 03:44:02,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:44:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6109 states and 9701 transitions. [2019-09-08 03:44:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:44:02,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:02,469 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:02,469 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:02,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:02,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1948697716, now seen corresponding path program 1 times [2019-09-08 03:44:02,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:02,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:02,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:02,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:44:02,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:02,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:44:02,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:44:02,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:44:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:44:02,640 INFO L87 Difference]: Start difference. First operand 6109 states and 9701 transitions. Second operand 7 states. [2019-09-08 03:44:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:02,980 INFO L93 Difference]: Finished difference Result 12271 states and 19557 transitions. [2019-09-08 03:44:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:44:02,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-09-08 03:44:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:03,013 INFO L225 Difference]: With dead ends: 12271 [2019-09-08 03:44:03,013 INFO L226 Difference]: Without dead ends: 6215 [2019-09-08 03:44:03,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:44:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2019-09-08 03:44:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 6165. [2019-09-08 03:44:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6165 states. [2019-09-08 03:44:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6165 states to 6165 states and 9765 transitions. [2019-09-08 03:44:03,551 INFO L78 Accepts]: Start accepts. Automaton has 6165 states and 9765 transitions. Word has length 184 [2019-09-08 03:44:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:03,552 INFO L475 AbstractCegarLoop]: Abstraction has 6165 states and 9765 transitions. [2019-09-08 03:44:03,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:44:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6165 states and 9765 transitions. [2019-09-08 03:44:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 03:44:03,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:03,562 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:44:03,562 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:03,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:03,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1894687028, now seen corresponding path program 1 times [2019-09-08 03:44:03,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:03,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:03,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:44:03,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:03,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:44:03,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:44:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:44:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:44:03,751 INFO L87 Difference]: Start difference. First operand 6165 states and 9765 transitions. Second operand 4 states. [2019-09-08 03:44:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:05,087 INFO L93 Difference]: Finished difference Result 21311 states and 33908 transitions. [2019-09-08 03:44:05,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:44:05,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-09-08 03:44:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:05,154 INFO L225 Difference]: With dead ends: 21311 [2019-09-08 03:44:05,154 INFO L226 Difference]: Without dead ends: 15183 [2019-09-08 03:44:05,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:44:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15183 states. [2019-09-08 03:44:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15183 to 14993. [2019-09-08 03:44:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14993 states. [2019-09-08 03:44:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14993 states to 14993 states and 23561 transitions. [2019-09-08 03:44:06,345 INFO L78 Accepts]: Start accepts. Automaton has 14993 states and 23561 transitions. Word has length 188 [2019-09-08 03:44:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:06,346 INFO L475 AbstractCegarLoop]: Abstraction has 14993 states and 23561 transitions. [2019-09-08 03:44:06,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:44:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 14993 states and 23561 transitions. [2019-09-08 03:44:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 03:44:06,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:06,351 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:06,351 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash -289299123, now seen corresponding path program 1 times [2019-09-08 03:44:06,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:06,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:06,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:06,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:06,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:44:06,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:06,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:44:06,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:44:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:44:06,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:06,498 INFO L87 Difference]: Start difference. First operand 14993 states and 23561 transitions. Second operand 9 states. [2019-09-08 03:44:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:07,131 INFO L93 Difference]: Finished difference Result 28630 states and 45486 transitions. [2019-09-08 03:44:07,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:44:07,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-09-08 03:44:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:07,205 INFO L225 Difference]: With dead ends: 28630 [2019-09-08 03:44:07,205 INFO L226 Difference]: Without dead ends: 14993 [2019-09-08 03:44:07,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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 03:44:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14993 states. [2019-09-08 03:44:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14993 to 14993. [2019-09-08 03:44:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14993 states. [2019-09-08 03:44:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14993 states to 14993 states and 23417 transitions. [2019-09-08 03:44:07,936 INFO L78 Accepts]: Start accepts. Automaton has 14993 states and 23417 transitions. Word has length 191 [2019-09-08 03:44:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:07,937 INFO L475 AbstractCegarLoop]: Abstraction has 14993 states and 23417 transitions. [2019-09-08 03:44:07,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:44:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14993 states and 23417 transitions. [2019-09-08 03:44:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 03:44:07,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:07,941 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:07,942 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:07,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1720123757, now seen corresponding path program 1 times [2019-09-08 03:44:07,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:07,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:07,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 03:44:08,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:08,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:44:08,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:44:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:44:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:08,100 INFO L87 Difference]: Start difference. First operand 14993 states and 23417 transitions. Second operand 9 states. [2019-09-08 03:44:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:13,305 INFO L93 Difference]: Finished difference Result 29719 states and 46900 transitions. [2019-09-08 03:44:13,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:44:13,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2019-09-08 03:44:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:13,342 INFO L225 Difference]: With dead ends: 29719 [2019-09-08 03:44:13,342 INFO L226 Difference]: Without dead ends: 4961 [2019-09-08 03:44:13,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:44:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2019-09-08 03:44:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 4915. [2019-09-08 03:44:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4915 states. [2019-09-08 03:44:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 7562 transitions. [2019-09-08 03:44:13,607 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 7562 transitions. Word has length 196 [2019-09-08 03:44:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:13,608 INFO L475 AbstractCegarLoop]: Abstraction has 4915 states and 7562 transitions. [2019-09-08 03:44:13,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:44:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 7562 transitions. [2019-09-08 03:44:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-09-08 03:44:13,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:13,635 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 12, 12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:44:13,635 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash 280940808, now seen corresponding path program 1 times [2019-09-08 03:44:13,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:13,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:13,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:13,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:13,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 31 proven. 84 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2019-09-08 03:44:14,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:14,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:14,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:15,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 5557 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:44:15,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 352 proven. 562 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2019-09-08 03:44:15,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:44:15,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:44:15,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:44:15,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:44:15,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:44:15,932 INFO L87 Difference]: Start difference. First operand 4915 states and 7562 transitions. Second operand 15 states. [2019-09-08 03:44:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:32,453 INFO L93 Difference]: Finished difference Result 16241 states and 25449 transitions. [2019-09-08 03:44:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 03:44:32,454 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 587 [2019-09-08 03:44:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:32,488 INFO L225 Difference]: With dead ends: 16241 [2019-09-08 03:44:32,488 INFO L226 Difference]: Without dead ends: 11169 [2019-09-08 03:44:32,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=2957, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 03:44:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11169 states. [2019-09-08 03:44:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11169 to 10283. [2019-09-08 03:44:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10283 states. [2019-09-08 03:44:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10283 states to 10283 states and 15594 transitions. [2019-09-08 03:44:32,859 INFO L78 Accepts]: Start accepts. Automaton has 10283 states and 15594 transitions. Word has length 587 [2019-09-08 03:44:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:32,860 INFO L475 AbstractCegarLoop]: Abstraction has 10283 states and 15594 transitions. [2019-09-08 03:44:32,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:44:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 10283 states and 15594 transitions. [2019-09-08 03:44:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-09-08 03:44:32,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:32,883 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:32,883 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1628427668, now seen corresponding path program 1 times [2019-09-08 03:44:32,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:32,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:32,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:32,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 27 proven. 50 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2019-09-08 03:44:33,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:33,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:44:33,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:34,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 5577 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:44:34,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2019-09-08 03:44:34,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:34,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-08 03:44:34,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:44:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:44:34,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:44:34,269 INFO L87 Difference]: Start difference. First operand 10283 states and 15594 transitions. Second operand 11 states. [2019-09-08 03:44:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:44,600 INFO L93 Difference]: Finished difference Result 32844 states and 52628 transitions. [2019-09-08 03:44:44,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:44:44,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 593 [2019-09-08 03:44:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:44,705 INFO L225 Difference]: With dead ends: 32844 [2019-09-08 03:44:44,705 INFO L226 Difference]: Without dead ends: 22556 [2019-09-08 03:44:44,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:44:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22556 states. [2019-09-08 03:44:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22556 to 21068. [2019-09-08 03:44:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21068 states. [2019-09-08 03:44:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21068 states to 21068 states and 32927 transitions. [2019-09-08 03:44:45,717 INFO L78 Accepts]: Start accepts. Automaton has 21068 states and 32927 transitions. Word has length 593 [2019-09-08 03:44:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:45,718 INFO L475 AbstractCegarLoop]: Abstraction has 21068 states and 32927 transitions. [2019-09-08 03:44:45,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:44:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 21068 states and 32927 transitions. [2019-09-08 03:44:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2019-09-08 03:44:45,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:45,738 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 15, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:44:45,739 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1485843947, now seen corresponding path program 1 times [2019-09-08 03:44:45,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:45,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:45,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:45,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:45,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-08 03:44:46,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:46,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:46,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:46,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 5593 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:44:46,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-09-08 03:44:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:47,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:44:47,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:44:47,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:44:47,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:47,140 INFO L87 Difference]: Start difference. First operand 21068 states and 32927 transitions. Second operand 9 states. [2019-09-08 03:44:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:48,491 INFO L93 Difference]: Finished difference Result 42618 states and 67781 transitions. [2019-09-08 03:44:48,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:44:48,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 610 [2019-09-08 03:44:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:48,576 INFO L225 Difference]: With dead ends: 42618 [2019-09-08 03:44:48,576 INFO L226 Difference]: Without dead ends: 22931 [2019-09-08 03:44:48,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:44:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22931 states. [2019-09-08 03:44:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22931 to 22880. [2019-09-08 03:44:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22880 states. [2019-09-08 03:44:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22880 states to 22880 states and 36187 transitions. [2019-09-08 03:44:49,334 INFO L78 Accepts]: Start accepts. Automaton has 22880 states and 36187 transitions. Word has length 610 [2019-09-08 03:44:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:49,335 INFO L475 AbstractCegarLoop]: Abstraction has 22880 states and 36187 transitions. [2019-09-08 03:44:49,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:44:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 22880 states and 36187 transitions. [2019-09-08 03:44:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-09-08 03:44:49,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:49,354 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:44:49,354 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash -916172021, now seen corresponding path program 1 times [2019-09-08 03:44:49,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:49,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:49,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:49,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:49,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1874 backedges. 27 proven. 54 refuted. 0 times theorem prover too weak. 1793 trivial. 0 not checked. [2019-09-08 03:44:49,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:49,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:49,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:50,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 6251 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:44:50,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1874 backedges. 348 proven. 634 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:44:51,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:44:51,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:44:51,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:44:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:44:51,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:44:51,203 INFO L87 Difference]: Start difference. First operand 22880 states and 36187 transitions. Second operand 15 states. [2019-09-08 03:45:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:10,285 INFO L93 Difference]: Finished difference Result 80344 states and 133100 transitions. [2019-09-08 03:45:10,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 03:45:10,287 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 697 [2019-09-08 03:45:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:10,523 INFO L225 Difference]: With dead ends: 80344 [2019-09-08 03:45:10,524 INFO L226 Difference]: Without dead ends: 57411 [2019-09-08 03:45:10,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=2137, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 03:45:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57411 states. [2019-09-08 03:45:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57411 to 53969. [2019-09-08 03:45:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53969 states. [2019-09-08 03:45:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53969 states to 53969 states and 86132 transitions. [2019-09-08 03:45:14,649 INFO L78 Accepts]: Start accepts. Automaton has 53969 states and 86132 transitions. Word has length 697 [2019-09-08 03:45:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:14,650 INFO L475 AbstractCegarLoop]: Abstraction has 53969 states and 86132 transitions. [2019-09-08 03:45:14,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:45:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 53969 states and 86132 transitions. [2019-09-08 03:45:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-09-08 03:45:14,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:14,674 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 11, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:45:14,674 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:14,675 INFO L82 PathProgramCache]: Analyzing trace with hash -775924782, now seen corresponding path program 1 times [2019-09-08 03:45:14,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:14,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:14,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:14,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:14,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 71 proven. 66 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2019-09-08 03:45:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:15,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:15,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:15,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 5049 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:45:15,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2019-09-08 03:45:15,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:15,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 03:45:15,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:45:15,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:45:15,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:45:15,950 INFO L87 Difference]: Start difference. First operand 53969 states and 86132 transitions. Second operand 13 states. [2019-09-08 03:45:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:23,828 INFO L93 Difference]: Finished difference Result 139457 states and 227549 transitions. [2019-09-08 03:45:23,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:45:23,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 576 [2019-09-08 03:45:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:24,185 INFO L225 Difference]: With dead ends: 139457 [2019-09-08 03:45:24,185 INFO L226 Difference]: Without dead ends: 82479 [2019-09-08 03:45:24,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 590 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:45:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82479 states. [2019-09-08 03:45:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82479 to 80699. [2019-09-08 03:45:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80699 states. [2019-09-08 03:45:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80699 states to 80699 states and 129707 transitions. [2019-09-08 03:45:30,641 INFO L78 Accepts]: Start accepts. Automaton has 80699 states and 129707 transitions. Word has length 576 [2019-09-08 03:45:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:30,642 INFO L475 AbstractCegarLoop]: Abstraction has 80699 states and 129707 transitions. [2019-09-08 03:45:30,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:45:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 80699 states and 129707 transitions. [2019-09-08 03:45:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-09-08 03:45:30,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:30,689 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 14, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:45:30,690 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1151560696, now seen corresponding path program 1 times [2019-09-08 03:45:30,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:30,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1409 backedges. 74 proven. 91 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2019-09-08 03:45:31,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:31,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:45:31,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:31,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 5071 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:45:31,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1409 backedges. 862 proven. 66 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2019-09-08 03:45:32,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:45:32,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 03:45:32,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:45:32,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:45:32,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:45:32,178 INFO L87 Difference]: Start difference. First operand 80699 states and 129707 transitions. Second operand 19 states. [2019-09-08 03:46:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:05,519 INFO L93 Difference]: Finished difference Result 276671 states and 470734 transitions. [2019-09-08 03:46:05,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 03:46:05,519 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 585 [2019-09-08 03:46:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:06,584 INFO L225 Difference]: With dead ends: 276671 [2019-09-08 03:46:06,585 INFO L226 Difference]: Without dead ends: 195691 [2019-09-08 03:46:06,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1435, Invalid=6575, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 03:46:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195691 states. [2019-09-08 03:46:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195691 to 182827. [2019-09-08 03:46:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182827 states. [2019-09-08 03:46:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182827 states to 182827 states and 298557 transitions. [2019-09-08 03:46:20,377 INFO L78 Accepts]: Start accepts. Automaton has 182827 states and 298557 transitions. Word has length 585 [2019-09-08 03:46:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:20,378 INFO L475 AbstractCegarLoop]: Abstraction has 182827 states and 298557 transitions. [2019-09-08 03:46:20,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:46:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 182827 states and 298557 transitions. [2019-09-08 03:46:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-09-08 03:46:20,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:20,449 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 13, 12, 12, 11, 11, 11, 11, 11, 11, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:20,449 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1012144534, now seen corresponding path program 1 times [2019-09-08 03:46:20,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:20,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:20,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:20,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 87 proven. 79 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2019-09-08 03:46:20,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:20,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:20,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:21,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 5073 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 03:46:21,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 854 proven. 78 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-09-08 03:46:21,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:46:21,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2019-09-08 03:46:21,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 03:46:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 03:46:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:46:21,824 INFO L87 Difference]: Start difference. First operand 182827 states and 298557 transitions. Second operand 17 states. [2019-09-08 03:47:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:20,316 INFO L93 Difference]: Finished difference Result 647724 states and 1098389 transitions. [2019-09-08 03:47:20,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 03:47:20,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 589 [2019-09-08 03:47:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:23,656 INFO L225 Difference]: With dead ends: 647724 [2019-09-08 03:47:23,656 INFO L226 Difference]: Without dead ends: 455527 [2019-09-08 03:47:24,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1023, Invalid=8097, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 03:47:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455527 states. [2019-09-08 03:48:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455527 to 445137. [2019-09-08 03:48:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445137 states. [2019-09-08 03:48:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445137 states to 445137 states and 731745 transitions. [2019-09-08 03:48:10,877 INFO L78 Accepts]: Start accepts. Automaton has 445137 states and 731745 transitions. Word has length 589 [2019-09-08 03:48:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:48:10,878 INFO L475 AbstractCegarLoop]: Abstraction has 445137 states and 731745 transitions. [2019-09-08 03:48:10,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 03:48:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 445137 states and 731745 transitions. [2019-09-08 03:48:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-09-08 03:48:10,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:48:10,970 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 12, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:10,970 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:48:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:48:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672223, now seen corresponding path program 1 times [2019-09-08 03:48:10,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:48:10,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:48:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:10,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 57 proven. 17 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2019-09-08 03:48:12,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:48:12,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:48:12,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:13,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 5055 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:48:13,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:48:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 771 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-08 03:48:13,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:48:13,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:48:13,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:48:13,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:48:13,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:48:13,179 INFO L87 Difference]: Start difference. First operand 445137 states and 731745 transitions. Second operand 6 states. [2019-09-08 03:48:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:48:51,051 INFO L93 Difference]: Finished difference Result 906674 states and 1525647 transitions. [2019-09-08 03:48:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:48:51,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 584 [2019-09-08 03:48:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:48:53,600 INFO L225 Difference]: With dead ends: 906674 [2019-09-08 03:48:53,600 INFO L226 Difference]: Without dead ends: 463519 [2019-09-08 03:48:56,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:48:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463519 states. [2019-09-08 03:49:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463519 to 463519. [2019-09-08 03:49:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463519 states. [2019-09-08 03:49:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463519 states to 463519 states and 725731 transitions. [2019-09-08 03:49:44,635 INFO L78 Accepts]: Start accepts. Automaton has 463519 states and 725731 transitions. Word has length 584 [2019-09-08 03:49:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:44,635 INFO L475 AbstractCegarLoop]: Abstraction has 463519 states and 725731 transitions. [2019-09-08 03:49:44,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 463519 states and 725731 transitions. [2019-09-08 03:49:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-09-08 03:49:44,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:44,694 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 12, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:49:44,694 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:44,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1710896570, now seen corresponding path program 1 times [2019-09-08 03:49:44,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:44,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:44,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:44,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:44,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2019-09-08 03:49:44,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:44,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:45,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:45,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 5058 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:45,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 760 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-09-08 03:49:47,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:47,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:47,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:47,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:47,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:47,088 INFO L87 Difference]: Start difference. First operand 463519 states and 725731 transitions. Second operand 6 states. [2019-09-08 03:50:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:28,220 INFO L93 Difference]: Finished difference Result 939980 states and 1505491 transitions. [2019-09-08 03:50:28,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:50:28,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 587 [2019-09-08 03:50:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:31,691 INFO L225 Difference]: With dead ends: 939980 [2019-09-08 03:50:31,691 INFO L226 Difference]: Without dead ends: 485251 [2019-09-08 03:50:33,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:33,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485251 states. [2019-09-08 03:51:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485251 to 485251. [2019-09-08 03:51:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485251 states. [2019-09-08 03:51:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485251 states to 485251 states and 749635 transitions. [2019-09-08 03:51:17,394 INFO L78 Accepts]: Start accepts. Automaton has 485251 states and 749635 transitions. Word has length 587 [2019-09-08 03:51:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:17,395 INFO L475 AbstractCegarLoop]: Abstraction has 485251 states and 749635 transitions. [2019-09-08 03:51:17,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 485251 states and 749635 transitions. [2019-09-08 03:51:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-09-08 03:51:17,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:17,448 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 12, 11, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:17,448 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1040584106, now seen corresponding path program 1 times [2019-09-08 03:51:17,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:17,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:17,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:17,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:17,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 87 proven. 58 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2019-09-08 03:51:29,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:29,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:29,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:30,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 5052 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 03:51:30,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 824 proven. 55 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2019-09-08 03:51:30,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:51:30,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-09-08 03:51:30,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:51:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:51:30,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:51:30,653 INFO L87 Difference]: Start difference. First operand 485251 states and 749635 transitions. Second operand 19 states.